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 <[email protected]>wrote: > Any functional complaint + it being illogical economically. Power to those > that rule. Fantastic plan. >
