From e28c33dfd9189e04eaf4d49e92504be175bfcd73 Mon Sep 17 00:00:00 2001 From: sanaz Date: Tue, 3 Oct 2023 15:46:04 -0700 Subject: [PATCH] fixes a typo --- spec/p2p/reactors/mempool-v1.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/spec/p2p/reactors/mempool-v1.md b/spec/p2p/reactors/mempool-v1.md index df896bd8b7..54b2148b98 100644 --- a/spec/p2p/reactors/mempool-v1.md +++ b/spec/p2p/reactors/mempool-v1.md @@ -67,7 +67,7 @@ These max rates are further constrained by the `SendRate` and `RecRate`. `incoming_traffic_rate = d * min(transaction_rate, SendRate)` `outgoing_traffic_rate = d * min(transaction_rate, RecRate)` -- **Best case scenario**: a transaction is exchanged only once, contributing to either incoming or outgoing traffic. This is because both ends of the connection keep track of the transactions they have seen on a connection (wither vua sending or receiving). If one peer sends a transaction before the other, they both mark it as sent/received, ensuring they do not redundantly transmit it to each other. +- **Best case scenario**: a transaction is exchanged only once, contributing to either incoming or outgoing traffic. This is because both ends of the connection keep track of the transactions they have seen on a connection (whether via sending or receiving). If one peer sends a transaction before the other, they both mark it as sent/received, ensuring they do not redundantly transmit it to each other. In a network, with transaction rate `transaction_rate` and a node with degree of `d`, the node's traffic rate in best case would be: `traffic_rate (=incoming_traffic_rate + outgoing_traffic_rate) = d * transaction_rate`