Author: Tier Nolan 2019-10-04 23:31:18
Published on: 2019-10-04T23:31:18+00:00
The context discusses a proposal to allow peers to prove their total chain proof-of-work (POW) by sending short proofs of height for disconnected headers and asserting the POW for those headers. Each peer could send the N strongest headers for their main chain and prove the height of each one, allowing for estimation of the total chain work as N times the POW for the lowest in the list. This proposal requires a new set of messages to request info about the best chain and allows for checking if multiple peers are on the same chain. The key is to limit things by peer rather than globally, such as splitting the limit to header width between peers and storing the current best/most POW header chain and at least one alternative chain per outgoing peer. Message limiting should also be per peer, as penalizing an honest peer who has just been connected to may not be fair.
Updated on: 2023-06-13T21:48:08.493582+00:00