📅 Original date posted:2017-04-20
📝 Original message:On Wednesday, 19 April 2017 19:30:30 CEST David Vorick via bitcoin-dev
wrote:
> > I suggested something similar which is a much simpler version;
> > https://zander.github.io/scaling/Pruning/
> Your proposal has a significant disadvantage: If every peer is dropping
> 75% of all blocks randomly, then you need to connect to a large number of
> peers to download the whole blockchain.
...
> If you are downloading 450,000 blocks, you will need to
> connect to an expected 46 peers to download the whole blockchain.
I don’t really see the problem here, even if your math is a off. (Statistics
is difficult, I know). Connecting to many nodes to download faster is really
not an issue and already happens.
> Your proposal is also a lot less able to handle active adversaries: if
> nodes are randomly dropping blocks, the probability that one block in
> particular is dropped by everyone goes up significantly.
You make the assumption that this new mode of pruning will be used by 100%
of the network, this is not how distributed systems work.
--
Tom Zander
Blog: https://zander.github.io
Vlog: https://vimeo.com/channels/tomscryptochannel
Tom Zander [ARCHIVE] /
npub1mj…dxnq7
2023-06-07 18:00:22
in reply to nevent1q…eyzp
Author Public Key
npub1mju50kqcm07heu967fkq6h4kq666xgekc4yrldf7q52xx9vr8jnsrdxnq7Published at
2023-06-07 18:00:22Event JSON
{
"id": "a2b4791813041e452a9b215c0bda66616147556cfa511c316b523d29039ab7a0",
"pubkey": "dcb947d818dbfd7cf0baf26c0d5eb606b5a32336c5483fb53e05146315833ca7",
"created_at": 1686160822,
"kind": 1,
"tags": [
[
"e",
"9e0bce6c49b056a94ef9193a53941e860a13142ae7014703964955e2e8de52b1",
"",
"root"
],
[
"e",
"31be29bba51b6cb11c76a57b915b19161f43fa050ba1a18aeee6b75cb4b5eebf",
"",
"reply"
],
[
"p",
"adcb53cdbd72e2a0c22452a9087f173c6b55edc7b504ff9b861e9c02af9a87d4"
]
],
"content": "📅 Original date posted:2017-04-20\n📝 Original message:On Wednesday, 19 April 2017 19:30:30 CEST David Vorick via bitcoin-dev \nwrote:\n\u003e \u003e I suggested something similar which is a much simpler version;\n\u003e \u003e https://zander.github.io/scaling/Pruning/\n\n\u003e Your proposal has a significant disadvantage: If every peer is dropping\n\u003e 75% of all blocks randomly, then you need to connect to a large number of\n\u003e peers to download the whole blockchain.\n...\n\u003e If you are downloading 450,000 blocks, you will need to\n\u003e connect to an expected 46 peers to download the whole blockchain.\n\nI don’t really see the problem here, even if your math is a off. (Statistics \nis difficult, I know). Connecting to many nodes to download faster is really \nnot an issue and already happens.\n\n\u003e Your proposal is also a lot less able to handle active adversaries: if\n\u003e nodes are randomly dropping blocks, the probability that one block in\n\u003e particular is dropped by everyone goes up significantly. \n\nYou make the assumption that this new mode of pruning will be used by 100% \nof the network, this is not how distributed systems work.\n\n-- \nTom Zander\nBlog: https://zander.github.io\nVlog: https://vimeo.com/channels/tomscryptochannel",
"sig": "8fa9b6a31b116e05e95c9b604e95e1c9905fb1650f291b713f027bc01d75b08bf88b9566ca36692a951e6dad68c4c1276143dbc0858e0c66681da415d0dea9d0"
}