Norway
Well-Known Member
- Sep 29, 2015
- 2,424
- 6,410
How do you reconstruct a historic list of events that has been sorted alphabetically?Also, note that BCH clients do have a CTOR->TTOR algorithm, which is used when a block is disconnected (eg a reorg).
I think we have to be wary about looking at things through the lens of 7 years of history. Bear in mind that it had been two years since the Garzik/Satoshi discussion about increasing the block size limit and blocks were still far from full. Though miners were soft-limited to 500k (though were still far from reaching it). Block size wouldn't really re-enter the group consciousness for another year. It's possible Gavin was just looking towards a miner-managed block access effort and not just about hitting the 1MB hard limit at that stage.After seeing that Gavin Andresen was actually the one to add the first modification of transaction ordering to accommodate Greg Maxwell's "full blocks" designs, surely in an effort at preserving harmony among the committers
So it's not a restoration of the timestamps a chronological order represents. It's just a random order where interdependent transactions are given a chronological order. Got it.It reconstructs one possible topological ordering for a given set of transactions, not necessarily the exact chronological order.
How do you reconstruct a historic list of events that has been sorted by fee? Further, a list of events you weren't sure of the history of in the first place.How do you reconstruct a historic list of events that has been sorted alphabetically?
doesn't the average 1mb block only hold ~2K?That went over my head.
Sounds like you're occupied with edge cases. Perfect is the enemy of good.History, as I said, is not well defined in any way. A node may receive dependent transactions in _inverted_ (yes, invalid!) order. So chronologically ordered blocks might not even make sense. Miners intentionally "fix history" to guarantee a topologically valid order.
Oh, sorry. The number just wasn't in my head so I thought it was some smart comment I'd misseddoesn't the average 1mb block only hold ~2K?
" -blockprioritysize=<n> " + _("Maximum bytes of high-priority/low-fee transactions (default: 27000)\n") +
2019-04-02T04:04:09Z AcceptToMemoryPool: peer=6: accepted 8ca76b5ccd194a89c585cf123ab62ffde9600030c1db15176fbe383646ec3e04 (poolsz 3488 txn, 18171 kB)
2019-04-02T04:04:09Z accepted orphan tx fb89b26a60de1d07ef35de2bc9283d09a6c8ca895d55d7a733c5647adb792dfb
2019-04-02T04:04:09Z stored orphan tx 787f9e54a7b1c3b42cf3f35981287ce6e1a4db89a5a8408e145e3adebae8f24a (mapsz 31 outsz 40)
2019-04-02T04:04:09Z stored orphan tx 308c8da967368360d3ea9d5f4dd60120dc8a634cc4f5a4af9480a31af2ef98c0 (mapsz 32 outsz 41)
2019-04-02T04:04:09Z stored orphan tx 1b7eb1d03855defdcc7633a2286c19566c708dde5e7bbac419cd7311d6ed96eb (mapsz 33 outsz 42)
2019-04-02T04:04:09Z stored orphan tx 40a3573ff84b6c555b5042ba2387cdd4949b5d6585e2cb2f4a9f408500ecf717 (mapsz 34 outsz 43)
2019-04-02T04:04:09Z AcceptToMemoryPool: peer=6: accepted 5b2986433b78a28661417705346ba4aca2f1e475cd108de0f8565aa249283055 (poolsz 3490 txn, 18173 kB)
2019-04-02T04:04:09Z accepted orphan tx 1b7eb1d03855defdcc7633a2286c19566c708dde5e7bbac419cd7311d6ed96eb
2019-04-02T04:04:09Z accepted orphan tx 787f9e54a7b1c3b42cf3f35981287ce6e1a4db89a5a8408e145e3adebae8f24a
2019-04-02T04:04:09Z accepted orphan tx adec5aba419f20570d3976864619863e126334418a14ef1fefac3d1194fb1eba
Yes. If you don't like big blocks because of [insert fluffy reasons here], then what you eventually end up doing is you have to keep the mining subsidy going on forever. Which means inflation, dolled out by the central bank (aka centralised developers, lobbied by the large miners). How is this any different from our existing central banking system? Oh right. You successfully replaced central bank economists with developers who have no background or expertise in managing and economy.@cypherdoc
Been to so many places, trollboxes, video, articles.... to get as much info as possible before i commit to increase my 25% BSV holding.
It is fair to assume with the avalanche of patent application that he protected BSV of future forks. There is the good and the bad, swim or sink.
I am 100% certain BTC will increase the 21 million cap at some stage (grin is part of this long term plan)
75% convinced BCH will increase also, yet to find a valid reason for BSV to raise the cap. fees of the big blocks will keep miners going.
patents and such is long way away form v 0.1 bitcoin.....
difficult decisions ahead, way over may head as an ex gold addict.
edit:
If he does not file for patents others will
https://thenextweb.com/hardfork/2019/03/13/data-china-is-patenting-all-the-blockchain-tech-despite-banning-cryptocurrency/
What's the problem?Hmm, it's not an edge case, it literally happens ALL the time. I've just restarted my btc node with -debug=mempool: I'm receiving at least 1 txn/s in inverted order (just check the timestamps below).
It doesn't require an "attack". An honest node generating dependent transactions and sending them *in order* will probably result in inverted order in a bunch of other nodes.
But keeping it real: what about my argument that BTC (even 0.1) and BSV don't store history any better? All bitcoins do sort transactions when creating block templates.
Code:2019-04-02T04:04:09Z AcceptToMemoryPool: peer=6: accepted 8ca76b5ccd194a89c585cf123ab62ffde9600030c1db15176fbe383646ec3e04 (poolsz 3488 txn, 18171 kB) 2019-04-02T04:04:09Z accepted orphan tx fb89b26a60de1d07ef35de2bc9283d09a6c8ca895d55d7a733c5647adb792dfb 2019-04-02T04:04:09Z stored orphan tx 787f9e54a7b1c3b42cf3f35981287ce6e1a4db89a5a8408e145e3adebae8f24a (mapsz 31 outsz 40) 2019-04-02T04:04:09Z stored orphan tx 308c8da967368360d3ea9d5f4dd60120dc8a634cc4f5a4af9480a31af2ef98c0 (mapsz 32 outsz 41) 2019-04-02T04:04:09Z stored orphan tx 1b7eb1d03855defdcc7633a2286c19566c708dde5e7bbac419cd7311d6ed96eb (mapsz 33 outsz 42) 2019-04-02T04:04:09Z stored orphan tx 40a3573ff84b6c555b5042ba2387cdd4949b5d6585e2cb2f4a9f408500ecf717 (mapsz 34 outsz 43) 2019-04-02T04:04:09Z AcceptToMemoryPool: peer=6: accepted 5b2986433b78a28661417705346ba4aca2f1e475cd108de0f8565aa249283055 (poolsz 3490 txn, 18173 kB) 2019-04-02T04:04:09Z accepted orphan tx 1b7eb1d03855defdcc7633a2286c19566c708dde5e7bbac419cd7311d6ed96eb 2019-04-02T04:04:09Z accepted orphan tx 787f9e54a7b1c3b42cf3f35981287ce6e1a4db89a5a8408e145e3adebae8f24a 2019-04-02T04:04:09Z accepted orphan tx adec5aba419f20570d3976864619863e126334418a14ef1fefac3d1194fb1eba
The point is that with TTOR, miners can still enforce chronological order at a later point. At scale you have a timechain as fine as 10min*(1/numOfTransactions).Your point? This block has already been accepted into the blockchain and is historical for all Bitcoin*. Probably for more POW than had even been applied to the chain up to that point.
I recognize weak blocks / subchains when I see them.That's exactly why I believe it's not a consensus rule. Bitcoin solved the problem of granular timestamping by consensus but in a latency filled system could never solve it by hard consensus at millisecond granularity. But in time if the value of more granular ordering is recognized by miners I would expected a softer 'semi-consensus' to emerge where if this ordering is respected other miners will respond with behaviour that favours those that accept the consensus.
honest question, if I may.So it's not a restoration of the timestamps a chronological order represents