Skip to Content.
Sympa Menu

bluesky - Re: Hi, and some comments

bluesky AT lists.ibiblio.org

Subject: Global-Scale Distributed Storage Systems

List archive

Chronological Thread  
  • From: Michael J Freedman <mfreed AT MIT.EDU>
  • To: "Global-Scale Distributed Storage Systems" <bluesky AT franklin.oit.unc.edu>
  • Subject: Re: Hi, and some comments
  • Date: Tue, 27 Feb 2001 23:25:56 -0500


At 10:19 PM 2/27/2001 -0600, you wrote:
>
>> you can use non-fungible type schemes, such as proofs of work (PoW). Adam
>> Back's hash cash is a clear example of such.
>
>I should have more clearly specified that I consider hash cash schemes to
>also be inappropriate as it then becomes an economic question of how much
>computing power you own. When the enemies of the system generally have
>more resources than the individual participants of the system, PoW schemes
>don't seem viable to me. So the micropayment scheme has to be one in which
>credit is given for participating in the network.

Well, this becomes one of resource allocation techniques. If the system is
not currently loaded, micropayments may not be necessary. (Our claim was
that payments are always necessary *only* when resources are used up
cumulatively -- such as permanent storage -- alternatively, for
temporarily-allocated resources (cache, bandwidth, etc.), payments may only
be necessary when the system is congested.)

But anyway, the above argument holds when a adversary can capitalize
greater resources to defeat the amount of work necessary to be shown.
There is an alternative, although more theoretical, for a class of
computationally difficult problems shown to be non-parallelizable (\element
NC). This was the basis for the LCS35 time capsule crypto puzzle.

Anyway, just thought I'd mention,
--mike

-----
"Not all those who wander are lost." mfreed AT mit.edu









Archive powered by MHonArc 2.6.24.

Top of Page