Author: Kaz Wesley 2014-07-31 22:27:59
Published on: 2014-07-31T22:27:59+00:00
In a discussion, Gregory Maxwell and Kaz Wesley debated about solving the problem of transmitting the transaction list. The current protocol involves exchanging information necessary to determine what a peer is missing, but FEC-based mempool synchronization can be implemented which eliminates false positives and offers a finer-grained mechanism for defining what a node can forget from its mempool. Channel memory sparse blocks achieve most of the possible bandwidth savings and when FEC-based mempool synchronization is implemented, its benefits can be applied to the sparse blocks by resetting the channel memory to the mutual mempool state each time mempool differences are exchanged. However, the FEC still lets you fill in the missing transactions without knowing in advance all that will be missing, so the need to solve this problem is not urgent. The suggestion on the network block coding page of using part of a cryptographic permutation as the key means that for unknown transactions, the transmission of the new unknown keys is always goodput and does not add overhead.
Updated on: 2023-06-09T01:08:30.281011+00:00