[BIP Draft] P2P UTXO Set Sharing

In a recent communication, the details regarding the operational mechanism of AssumeUTXO within Bitcoin Core were clarified. The discussion highlighted that an AssumeUTXO node does not operate without validation; rather, it validates headers upfront while the historical chain undergoes validation in the background. This process aligns with the typical Initial Block Download (IBD) but is executed in a different sequence.

The trust window associated with background validation is limited, minimizing the potential attack surface. For a transaction to be confirmed, it must appear in a block on a chain with validated headers. Moreover, for an attacker to mislead a user into accepting a fraudulent transaction involving non-existent UTXOs, a significant portion of the mining hashpower would need to support this deceit, making such an attack highly improbable. Additionally, any inconsistencies with malicious snapshots are likely to be identified during the background validation process when the assumed snapshot height is reached.

The inclusion of the AssumeUTXO hash in the Bitcoin Core source code follows standard procedures involving peer review through pull requests. This hash, like other critical constants such as the genesis block hash and network settings, holds comparable trust levels, reflecting the community's reliance on the integrity of the reviewed codebase since its inception in 2009. These practices underline the decentralized nature of code validation in not just Bitcoin Core but also in other implementations like libbitcoin.

The protocol intentionally does not specify the origin of the Merkle root, allowing each implementation flexibility in establishing this crucial element. This approach empowers different implementations to innovate or adapt their methods for integrating UTXO data verification. Bitcoin Core's implementation of AssumeUTXO serves as an example of how these concepts can be practically applied, offering a model for other systems to possibly adopt or modify according to their unique requirements.