Download Soulseek 157 test 4

Soulseek is a p2p exchange program and uses so-called virtual spaces in which users with the same interests can come together. This makes it possible to quickly and easily get your own taste. The development team is busy getting version 157 off the ground, which mainly focuses on redeveloping the search function. The fourth test version has been available for a few days with the following note:

yes yes y’all, i screwed up the child depth relay code. here’s a great example of why you shouldn’t program when you’re stoned. feeling geeky? ok then. one thing that’s done on the new distributed network that’s wasn’t done before is that for each client we are now keeping track of what we call: child depth. when the client doesn’t have any children, its child depth is 0. if the client has any number of children, its child depth is 1. unless they have any children of their own in which case it would be 2. unless those children have their own children… you get the idea. what child depth signifies is the number of levels of children a client has “under them”. that information lets us make fairly sure that the distributed network as a whole doesn’t grow past a certain depth, and that in turn helps give faster search results and more of them since ultimately there is less chance of failure along the way. this kind of depth information is collected from the very bottom of the network — from childless children to parentmost parents each hop is automatically counted as one level of depth. this is what our problem was: without the proper intervening logic we made the client consider the word of the most recently talkative child about any of those that preceded. this is no good if we’re already recorded to have one child of say, level depth 3 (thus making our own – 4) but then are told of a child that has a child depth of 0 (which incorrectly records our new depth as 1 when our actual depth hasn’t really changed. silly? yes, but that’s being overworked for ya. and this is what test 4 is all about fixing.