<> > <scipient> steven and oskar argued about that > <scipient> the idea is that you can support more than > one verification method > <insanity> so how can i set up a dbr that'll actually > work? > <scipient> i.e. the tla only fixes the major byte of the > keytype > <scipient> not necessarily the minor byte The idea is that the TLA gives the layout of the URI, the bytes give the verification method of the key. They are not entirely orthogonal, but it is not as simple as correlating the major byte with the TLA either. <> > <scipient> actually, i propose we retain byte 21 but > relax the verification on non CHKs to file size <= > rather than == Tavin Cole, proud inventor of the wheel! (This was the point with byte 21, even though power of 2 sizes are not mandated in 0.3, we could have mandated that size belonged to [2^(byte21-1) , 2^byte21].) <> > <insanity> i've tested hardsuck vs hardpush - @ htl<100, > the hardest suck fails > <oierw> the hardest push fucks up the network for > everyone > <oierw> take your pick > <insanity> even inserting @ htl=100, many hard sucks fail What I keep wondering is why people even bother then... -- 'DeCSS would be fine. Where is it?' 'Here,' Montag touched his head. 'Ah,' Granger smiled and nodded. Oskar Sandberg [EMAIL PROTECTED] _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://lists.freenetproject.org/mailman/listinfo/devl
