[Cryptography] A new, more efficient consensus protocol

[Pete Wayner]

I like the idea of proof of luck and your paper.

Here's a simple hack for the purpose of discussion:

* Every node chooses a random value, x_i.
* Every node shares h(x_i).
* Once every node unpacks the commitment, everyone shares x_i
* Everyone computes h(x_1 + x_2 + ....) where plus means bitwise XOR.
* Winner is the node whose value x_i is closest to h(x_1 + x_2 + ....)
using hamming distance. Use first different bit as a tie breaker.

If there are a lot of nodes, broadcast may be an issue.

Where are the fault lines? How does my approximation fall short?

-Peter
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://www.metzdowd.com/pipermail/cryptography/attachments/20210114/68e9d2f8/attachment.htm>