On Saturday 11 August 2007 23:05, Edgar Friendly wrote: > Matthew Toseland wrote: > > On Friday 10 August 2007 21:23, Edgar Friendly wrote: > >> Jerome Flesch wrote: > >>> With a WoT, if you accept to read the new-comers, you accept to read > >>> the spam. So in the end, you risk to end with no-one reading anymore > >>> the posts from the newbies. > >> > >> Might it work to distribute the load of looking at unsigned posts to all > >> readers? Instead of a few trusted people looking through mounds of spam > >> to find a few newbie posts, maybe each user could get a dozen posts to > >> filter for the community. I don't know if a random distribution or some > >> sort of slicing method would work better, they each have their ups and > >> downs. > > > > Hashcash/thinkcash puzzles set by each user approximate this. The > > difficulty could automatically escalate over multiple posts, and > > de-escalate over time. > > Do you suggest that each established user create *cash puzzles, and new > posters choose one or many of these puzzles to solve in order to get > through untrusted/unknown-user-blocking so they can start to earn trust?
Yes. > > I don't get your point about difficulty of puzzles, they'd go by the > wayside once a person entered the web of trust, no? Yes. You could increase the difficulty so that they chose somebody else? I dunno, there was some good reason.. :)
pgpPqsRQQzzTn.pgp
Description: PGP signature
_______________________________________________ Devl mailing list Devl@freenetproject.org http://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
