Am Samstag, 13. Oktober 2012, 05:41:25 schrieb xor: > I strongly feel that this might be just a different model of the same stuff > we do with current web of trust systems
I thought the same at the beginning, but I now think it might actually have a different domain. In a web of trust, an update is cheap, but it propagates slowly because it is polling based. More exactly: The polling is done by the downloaders. In the group keys, it seems that the cost of the polling will be pushed to the upload side, because the stored keys will be updated more often: The verification has to be done by the nodes accepting the upload (on the storage layer). Imagine a group of 5 people who all post with roughly the same frequency. Everytime one of the posts, that’s one poll on the key and then one upload. Imagine on the other hand a group of 20 000 people where only 5 post. Then the upload checking would waste much less time. It would be pretty similar to a WoT where every user also publishes the 5 most recent updates from people he/she trusts. That could even be done context- based: Just include the revisions of the last 5 posters in the 5 forum boards we last wrote to. Effectively it seems to be key-merging in the storage layer to avoid intermediate fetching from and reuploading into freenet. That *could* actually be an algorithmic advantage, because the speed of freenet changes with the number of accesses, and that number might not enter the merging on the storage-level. Does that sound about right? Best wishes, Arne -- Ich hab' nichts zu verbergen – hab ich gedacht: - http://draketo.de/licht/lieder/ich-hab-nichts-zu-verbergen
signature.asc
Description: This is a digitally signed message part.
_______________________________________________ Devl mailing list Devl@freenetproject.org https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
