Preliminary:
Alice has the ability to hear of a block before all other miners do.
The Problem:
Say Alice built a block, A1, from previous block 0. She doesn't let other
miners know about it. She then works on A2 with previous block A1. Bob on the
other hand is still working on B1 with previous
I don't think choosing the block with the lowest hash is the best
option. The good and bad miners have an equal probability of finding a
lower hash. But after Alice finds a block she can easily determine the
probability that someone else will find a lower hash value that meets
the difficulty
On 5 November 2013 20:51, c...@safe-mail.net wrote:
Possible Solution:
If N amount of blocks built of the same previous block are received within
a time frame of T mine on the block with the lowest hash.
Logic:
In order for Alice to pull of this attack she not only has to propagate
her
On 5 November 2013 22:07, Quinn Harris btc...@quinnharris.me wrote:
I don't think choosing the block with the lowest hash is the best
option. The good and bad miners have an equal probability of finding a
lower hash. But after Alice finds a block she can easily determine the
probability
On Tue, Nov 5, 2013 at 2:15 PM, Drak d...@zikula.org wrote:
If I understand the issue properly, this seems like a pretty elegant
solution: if two blocks are broadcast within a certain period of eachother,
chose the lower target. That's a provable fair way of randomly choosing the
winning block
On 5 November 2013 23:06, Gregory Maxwell gmaxw...@gmail.com wrote:
On Tue, Nov 5, 2013 at 2:15 PM, Drak d...@zikula.org wrote:
If I understand the issue properly, this seems like a pretty elegant
solution: if two blocks are broadcast within a certain period of
eachother,
chose the lower
On 11/05/2013 08:03 PM, Drak wrote:
On 5 November 2013 22:07, Quinn Harris btc...@quinnharris.me
mailto:btc...@quinnharris.me wrote:
I don't think choosing the block with the lowest hash is the best
option. The good and bad miners have an equal probability of
finding a
lower
7 matches
Mail list logo
