Jae Kwon fa07748d23 | 11 years ago | |
---|---|---|
.. | ||
README.md | 11 years ago | |
addrbook.go | 11 years ago | |
client.go | 11 years ago | |
client_test.go | 11 years ago | |
connection.go | 11 years ago | |
knownaddress.go | 11 years ago | |
listener.go | 11 years ago | |
log.go | 11 years ago | |
msg.go | 11 years ago | |
netaddress.go | 11 years ago | |
peer.go | 11 years ago | |
server.go | 11 years ago | |
upnp.go | 11 years ago | |
upnp_test.go | 11 years ago | |
util.go | 11 years ago |
Each peer connection is multiplexed into channels.
The default channel is used to communicate state changes, pings, peer exchange, and other automatic internal messages that all P2P protocols would want implemented.
Channel | "" |
Messages |
|
The block channel is used to propagate block or header information to new peers or peers catching up with the blockchain.
Channel | "block" |
Messages |
|
Notes | Nodes should only advertise having a header or block at height 'h' if it also has all the headers or blocks less than 'h'. Thus for each peer we need only keep track of two integers -- one for the most recent header height 'h_h' and one for the most recent block height 'h_b', where 'h_b' <= 'h_h'. |
The mempool channel is used for broadcasting new transactions that haven't yet entered the blockchain. It uses a lossy bloom filter on either end, but with sufficient fanout and filter nonce updates every new block, all transactions will eventually reach every node.
Channel | "mempool" |
Messages |
|
Notes |
Instead of keeping a perfect inventory of what peers have, we use a lossy filter. Bloom filter (n:10k, p:0.02 -> k:6, m:10KB) Each peer's filter has a random nonce that scrambles the message hashes. The filter & nonce refreshes every new block. |
The consensus channel broadcasts all information used in the rounds of the Tendermint consensus mechanism.
Channel | "consensus" |
Messages |
|
Notes | How do optimize/balance propagation speed & bandwidth utilization? |