📅 Original date posted:2014-07-05
📝 Original message:>
> Is it possible instead to allocate a portion of the reward to " a # of
> runner up(s)" even though the runner-up(s) block will be orphaned?
>
There's really no concept of a "runner up" because hashing is progress
free. It's unintuitive and often trips people up. There's no concept that
everyone is 95% of the way to finding a solution and then someone pips you
to the post. It's more like playing the lottery over and over again.
Doesn't matter how many times you did it before, the next time your chances
are the same.
A better concept is of rewarding "near miss" solutions which is what we
already do of course, via pools, which pay you for shares which don't quite
meet the difficulty target but almost do. So the question is how can we
implement pools which have this reward structure (which obviously works
well) without miners simultaneously giving up their right to block creation
either due to technical problems or sheer lazyness.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20140705/1d09c441/attachment.html>;
Mike Hearn [ARCHIVE] /
npub17t…4qgyd
2023-06-07 15:23:37
in reply to nevent1q…z29h
Author Public Key
npub17ty4mumkv43w8wtt0xsz2jypck0gvw0j8xrcg6tpea25z2nh7meqf4qgydPublished at
2023-06-07 15:23:37Event JSON
{
"id": "87ba9d3dabaa0efe8ea3e594f87840504ff2713d85570d59d6222239106c62fd",
"pubkey": "f2c95df3766562e3b96b79a0254881c59e8639f23987846961cf55412a77f6f2",
"created_at": 1686151417,
"kind": 1,
"tags": [
[
"e",
"a9e20ae1b6e168ee862b71e56f89b4ed7603371912b3a24e648d19074482f62c",
"",
"root"
],
[
"e",
"666c015ea15aa06240c6488774b7424d65d475ea05dc7e2fa6ab96c41b6f2cd9",
"",
"reply"
],
[
"p",
"708e24fcfd14f404ccd45d1b5f15ce9a745b6720af76c806857cd821f260e6c6"
]
],
"content": "📅 Original date posted:2014-07-05\n📝 Original message:\u003e\n\u003e Is it possible instead to allocate a portion of the reward to \" a # of\n\u003e runner up(s)\" even though the runner-up(s) block will be orphaned?\n\u003e\n\nThere's really no concept of a \"runner up\" because hashing is progress\nfree. It's unintuitive and often trips people up. There's no concept that\neveryone is 95% of the way to finding a solution and then someone pips you\nto the post. It's more like playing the lottery over and over again.\nDoesn't matter how many times you did it before, the next time your chances\nare the same.\n\nA better concept is of rewarding \"near miss\" solutions which is what we\nalready do of course, via pools, which pay you for shares which don't quite\nmeet the difficulty target but almost do. So the question is how can we\nimplement pools which have this reward structure (which obviously works\nwell) without miners simultaneously giving up their right to block creation\neither due to technical problems or sheer lazyness.\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20140705/1d09c441/attachment.html\u003e",
"sig": "704078fd46f0abf199fc66b3a2c64cf39b51b58c86fc3a0e7aba7543fd087a1a65194dc6817c9acbe24ef200fe92cbedd190722773bc0744c352eb27be124af9"
}