š
Original date posted:2015-08-04
š Original message:On Tue, Aug 4, 2015 at 2:41 PM, Dave Hudson via bitcoin-dev <
bitcoin-dev at lists.linuxfoundation.org> wrote:
> Fundamentally a block maker (pool or aggregation of pools) does not orphan
> its own blocks.
Unless the block maker has an infinitely fast connection to it's hashpower
OR it's hashpower is not parallelized at all, that's not strictly true --
it WILL orphan its own blocks because two hashing units will find solutions
in the time it takes to communicate that solution to the block maker and to
the rest of the hashing units.
That's getting into "how many miners can dance on the head of a pin"
territory, though. I don't think we know whether the communication
advantages of putting lots of hashing power physically close together will
outweigh the extra cooling costs of doing that (or maybe some other
tradeoff I haven't thought of). That would be a fine topic for another
paper....
--
--
Gavin Andresen
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20150804/a696269d/attachment.html>;
Gavin Andresen [ARCHIVE] /
npub1s4ā¦d44kw
2023-06-07 17:32:48
in reply to nevent1qā¦g3ul
Author Public Key
npub1s4lj77xuzcu7wy04afcr487f0r3za0f8n2775xrpkld2sv639mjqsd44kwSeen on
wss://relay.noswhere.comPublished at
2023-06-07 17:32:48Event JSON
{
"id": "df7e61e688013a7f98dc001c654d23d51c4b06773c60385dedafacdc0c10cc1d",
"pubkey": "857f2f78dc1639e711f5ea703a9fc978e22ebd279abdea1861b7daa833512ee4",
"created_at": 1686159168,
"kind": 1,
"tags": [
[
"e",
"2da2e00d8e383de13f6ee6d9d66f9da48994b834188a0ae47ea0319febd85ff5",
"",
"root"
],
[
"e",
"3ede308d787ae6b368acaadd9b38ff1d29f3e1b51b4ee8e17a2a182b8e66c281",
"",
"reply"
],
[
"p",
"daa2fc676a25e3b5b45644540bcbd1e1168b111427cd0e3cf19c56194fb231aa"
]
],
"content": "š
Original date posted:2015-08-04\nš Original message:On Tue, Aug 4, 2015 at 2:41 PM, Dave Hudson via bitcoin-dev \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\n\u003e Fundamentally a block maker (pool or aggregation of pools) does not orphan\n\u003e its own blocks.\n\n\nUnless the block maker has an infinitely fast connection to it's hashpower\nOR it's hashpower is not parallelized at all, that's not strictly true --\nit WILL orphan its own blocks because two hashing units will find solutions\nin the time it takes to communicate that solution to the block maker and to\nthe rest of the hashing units.\n\nThat's getting into \"how many miners can dance on the head of a pin\"\nterritory, though. I don't think we know whether the communication\nadvantages of putting lots of hashing power physically close together will\noutweigh the extra cooling costs of doing that (or maybe some other\ntradeoff I haven't thought of). That would be a fine topic for another\npaper....\n\n-- \n--\nGavin Andresen\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20150804/a696269d/attachment.html\u003e",
"sig": "2cef9e480735f6bab16047195e3a0daed642c25d0643196d169918bf829b8e341c240d6e337a246dfd74d8b59f2348de0200e0a569c35b6a5db20a51c7b1f453"
}