Author: Tier Nolan 2017-12-11 22:41:50
Published on: 2017-12-11T22:41:50+00:00
On December 11, 2017, Jim Posen proposed a possible implementation of omitting nBits entirely to save an extra 4 bytes. However, this could lead to more complexity as it would leak into the validation code. As a compromise, Posen suggested using one byte to indicate the difference since the last header and stealing bits from the exponent to indicate mode - no change, mantissa offset for small changes, or full difficulty. This approach would support any nBits rule and save three of the four bytes. In terms of parallel header fetching, Posen suggested adding a message where nodes could request the lowest N hashes between two heights on the main chain and receive an array of {height, header} pairs for the N headers with the lowest hash in the specified range. If there is disagreement among peers, it would allow narrowing down on which segment there is disagreement. There is also a method called "high hash highway" that allows compact proofs of total POW.
Updated on: 2023-06-12T15:09:34.120825+00:00