📅 Original date posted:2018-04-02
📝 Original message:Hi all,
I have a couple of ideas regarding transaction relay protocol and wanted to share it with and probably get some feedback.
I did some emulation and simulation and found out that around 90% of INV messages sent by public-IP nodes are idle (duplicate), obviously because each node creates 8 connections. I also realized that sending INV messages is a significant part of the overall bandwidth consumed by a public-IP node. At a larger scale, this will result in people not able to run a public-IP node.
My idea is in some sense similar to BIP37 but applied to public-IP nodes. Here I want to emphasize that all the nodes will still receive *all* of the transactions. A new protocol should also keep the same zero-trust, robustness, decentralization guarantees and latency.
Idea: while joining the network, a new node agrees on some filter with each of 8 nodes it connects to. So that NewNode <-> Node_A will be used to relay only a subset of transactions, NewNode <-> Node_B for another subset. This will significantly decrease the redundancy.
To keep the guarantees, I would keep some redundancy (for example, each transaction INV is sent over 2 links).
To make it robust to attacks, I have 2 extensions in my mind:
1. Set reconciliation (for a subset of transactions) with *other* nodes. Getting a bloom filter of a subset of the mempool transactions from Node_B may help to figure out whether Node_A is malicious, very slow, etc.
2. Rotating the filters every N minutes (N < 10)
I can see some issues with latency here, but I believe this problem has a solution.
Feedback is appreciated!
If you want to look at a draft of the proposal — please let me know.
If there were any similar ideas — please let me know.
Best,
Gleb
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20180402/a990f1dc/attachment.html>;
Gleb Naumenko [ARCHIVE] /
npub1fl…94tkz
2023-06-07 18:11:27
in reply to nevent1q…azme
Author Public Key
npub1fldyzvpmt2yx6a4tu8asjpkrrn0xy3daht37549g7yzlrm65l7dsq94tkzPublished at
2023-06-07 18:11:27Event JSON
{
"id": "c6fa9e94b233e4ef936864b81748c7378a3e993e66b5ce23bd91061481084bc9",
"pubkey": "4fda41303b5a886d76abe1fb0906c31cde6245bdbae3ea54a8f105f1ef54ff9b",
"created_at": 1686161487,
"kind": 1,
"tags": [
[
"e",
"972fe8112f102edf80789113023b409ca66792ec5917d0abee346e0568b71cc4",
"",
"reply"
],
[
"p",
"a23dbf6c6cc83e14cc3df4e56cc71845f611908084cfe620e83e40c06ccdd3d0"
]
],
"content": "📅 Original date posted:2018-04-02\n📝 Original message:Hi all,\nI have a couple of ideas regarding transaction relay protocol and wanted to share it with and probably get some feedback.\n\nI did some emulation and simulation and found out that around 90% of INV messages sent by public-IP nodes are idle (duplicate), obviously because each node creates 8 connections. I also realized that sending INV messages is a significant part of the overall bandwidth consumed by a public-IP node. At a larger scale, this will result in people not able to run a public-IP node.\n\nMy idea is in some sense similar to BIP37 but applied to public-IP nodes. Here I want to emphasize that all the nodes will still receive *all* of the transactions. A new protocol should also keep the same zero-trust, robustness, decentralization guarantees and latency.\n\nIdea: while joining the network, a new node agrees on some filter with each of 8 nodes it connects to. So that NewNode \u003c-\u003e Node_A will be used to relay only a subset of transactions, NewNode \u003c-\u003e Node_B for another subset. This will significantly decrease the redundancy.\n\nTo keep the guarantees, I would keep some redundancy (for example, each transaction INV is sent over 2 links).\n\nTo make it robust to attacks, I have 2 extensions in my mind:\n1. Set reconciliation (for a subset of transactions) with *other* nodes. Getting a bloom filter of a subset of the mempool transactions from Node_B may help to figure out whether Node_A is malicious, very slow, etc.\n2. Rotating the filters every N minutes (N \u003c 10)\n\nI can see some issues with latency here, but I believe this problem has a solution.\n\nFeedback is appreciated!\n\nIf you want to look at a draft of the proposal — please let me know.\nIf there were any similar ideas — please let me know.\n\nBest,\nGleb\n\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20180402/a990f1dc/attachment.html\u003e",
"sig": "91e729e81c49e4b9bc4c40016f3e74e3045141a7f3ac0c97649cef734054879ecebaa6ed0bff49ccfffcc0e41e857d769e90fcaddab4bc0a9f291b107bce09a3"
}