Disclaimer: this question is more blockchain than Bitcoin-related, but because there isn’t a blockchain StackExchange I’m asking it here. Thanks for understanding.
I’m working on a new blockchain based concept in which blocks can become significantly big in metadata (up to ≈25MB). This is not a bug, it is a feature (but not relevant to the question) 🙂
One of the solutions for limiting the size is that I don’t want to distribute the huge blocks to all nodes in the network but to a few random ones. The idea behind this is that the network grows slower, but is still decentralized and anonymous.
I’m thinking of introducing the following rule to distribute blocks to the network:
The block is distributed to X nodes, the other nodes are informed of the blocks’ whereabouts in the network.
Now my problem lies in determining X. I can do a few things;
- Send the blocks to a fixed amount of nodes in the network (i.e., 3)
- Send the blocks to a percentage of nodes to the network (i.e., 10%)
- Apply a formula based on the network size (i.e., square root of the total amount of nodes
√35≈6)
Although the third option seems the most logical one, I can’t think of a proper (statistically viable) explanation. The idea is that the information only gets lost if the randomly chooses nodes are disconnected from the network.
Any tips or advice how to go about solving this issue?
