📅 Original date posted:2013-11-05
📝 Original message:On 5 November 2013 22:07, Quinn Harris <btcdev at 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 that someone else will find a lower hash value that meets
> the difficulty requirement. This can be used to judge if its best to
> start working on the next block or work on finding a lower value hash to
> increase the chance her block is used.
Well in that case, you could make it unpredictable by choosing based on a
hash of the blockhash and chose the lowest from two. There is no way for
Alice to know if Bob's resulting hash will be higher or lower than hers
since she does not know Bob's blockhash in advance and therefore she would
be better broadcasting her block immediately.
You could even add another unpredictable factor: deciding the rules of
whether higher or lower wins by hashing both competing blockhashes. If the
leading two hex digits are below 128 lower wins, and if above, higher wins.
Drak
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20131105/f54e78ea/attachment.html>;
Drak [ARCHIVE] /
npub12r…3aqxc
2023-06-07 15:08:57
in reply to nevent1q…kswx
Author Public Key
npub12rkw0jajmsck4uwdtksdvtswrlkypusfryjzera7m4fhqta6jhdsz3aqxcPublished at
2023-06-07 15:08:57Event JSON
{
"id": "c4eed664382e728df1bafc7361277a3ccae9ed2ce4c4346503d7711f3c2c6049",
"pubkey": "50ece7cbb2dc316af1cd5da0d62e0e1fec40f20919242c8fbedd53702fba95db",
"created_at": 1686150537,
"kind": 1,
"tags": [
[
"e",
"dd9a0a21ae453b21f17e719fb1891cdb2e4fc4a879915c5fae5b4e2c57852fb3",
"",
"root"
],
[
"e",
"94def1b289c08c7f980839fa7b8529f2f0dce0426b27be5251c48e584bdc3c4b",
"",
"reply"
],
[
"p",
"388299928341f4a3404cb45b5bce7d7c7d893db9df9a14475d1706e314ae0cd2"
]
],
"content": "📅 Original date posted:2013-11-05\n📝 Original message:On 5 November 2013 22:07, Quinn Harris \u003cbtcdev at quinnharris.me\u003e wrote:\n\n\u003e I don't think choosing the block with the lowest hash is the best\n\u003e option. The good and bad miners have an equal probability of finding a\n\u003e lower hash. But after Alice finds a block she can easily determine the\n\u003e probability that someone else will find a lower hash value that meets\n\u003e the difficulty requirement. This can be used to judge if its best to\n\u003e start working on the next block or work on finding a lower value hash to\n\u003e increase the chance her block is used.\n\n\nWell in that case, you could make it unpredictable by choosing based on a\nhash of the blockhash and chose the lowest from two. There is no way for\nAlice to know if Bob's resulting hash will be higher or lower than hers\nsince she does not know Bob's blockhash in advance and therefore she would\nbe better broadcasting her block immediately.\n\nYou could even add another unpredictable factor: deciding the rules of\nwhether higher or lower wins by hashing both competing blockhashes. If the\nleading two hex digits are below 128 lower wins, and if above, higher wins.\n\nDrak\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20131105/f54e78ea/attachment.html\u003e",
"sig": "7748a3115bf8ce630189c8ebdfb711d57a29c66756a3ca164501ddb6a79d2e08c781386309592a57e9d9d3e190b8e7868f7dad02f12c7bacd534063034fdc793"
}