1993-03-03 - implementing positive reputation systems

Header Data

From: tribble@xanadu.com (E. Dean Tribble)
To: cypherpunks@toad.com
Message Hash: d2f9e44081b4245db761aa486244bf567522496f4358813e65c03a442193b918
Message ID: <9303022249.AA26686@memexis.xanadu.com>
Reply To: N/A
UTC Datetime: 1993-03-03 09:29:32 UTC
Raw Date: Wed, 3 Mar 93 01:29:32 PST

Raw message

From: tribble@xanadu.com (E. Dean Tribble)
Date: Wed, 3 Mar 93 01:29:32 PST
To: cypherpunks@toad.com
Subject: implementing positive reputation systems
Message-ID: <9303022249.AA26686@memexis.xanadu.com>
MIME-Version: 1.0
Content-Type: text/plain

The scheme I always think of when envisioning positive reputation
systems is that I get the feed of everything I might be interested in,
then sort and filter using whatever cleverness I desire.  Occasionally
(perhaps regularly) I exchange message with various people so that we
can update our transitive reputation information.

Eric Hughes and the recent discussion about volume problems got me
thinking about how to implement positive reputations at server sites.
I want a system in which the semantics are similar to the ideal
scenario above, but lower overhead in bandwidth and in processing
power for the receiver.  I suspect that the mailing list server would
provide filtering, and the receiver would provide sorting.

This will let us create mailing lists with anonymous participants
without letting them overwhelm the list.  It controls volume, etc.

Anyone with ideas, please send them to me (or the list) and I'll
collect them and post them.