I strongly feel that this might be just a different model of the same stuff we do with current web of trust systems Further it could be implemented with the existing key mechanisms most likely instead of bloating up the node with a complex new key scheme.
What I especially dislike is that you are still using vague verbal estimations of algorithmic complexity instead of math when trying to decide to implement such huge new systems. - If you or someone else bothered to compute the math behind the complexity of WoT with hints & (yet-to-be-implemented) limited polling depth (poll only direct trusted identities and their trustees) and the system which was suggested here, it would probably show that both are O(N*log(N)*blabla) or something similarly manageable. I won't actually do the math because I am not good at it. However I have a very strong feeling that it should be done before implementing such a complex questionable system. Ask Evan maybe. _______________________________________________ Devl mailing list Devl@freenetproject.org https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
