Proof of Stake...

Sean Lynch seanl at literati.org
Fri Feb 7 11:53:33 PST 2014


AIUI there are multiple ways to implement proof-of-stake. A friend of mine
proposed treating the chain with the most coin days destroyed (along with
correct difficulties for the standard proof-of-work function) as the
"longest" one rather than only the most difficult chain. Does that not work?


On Fri, Feb 7, 2014 at 2:40 AM, Lodewijk andré de la porte <l at odewijk.nl>wrote:

> Any functional complaint + it being illogical economically. Power to those
> that rule. Fantastic plan.
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: text/html
Size: 804 bytes
Desc: not available
URL: <http://lists.cpunks.org/pipermail/cypherpunks/attachments/20140207/034eef7e/attachment-0001.txt>


More information about the cypherpunks mailing list