Prohibit Merkle Internal Node Preimages That Encode Minimal 64-Byte Transactions

The recent discussions on the Bitcoin Development Mailing List have highlighted a significant update in the verification process of transactions within the blockchain. A new rule has been introduced that modifies how proofs are handled, specifically targeting the structure and interpretation of transaction data within nodes. Unlike previous methods, this change does not involve additional data but applies a fresh constraint to the existing data structures used in transaction proofs.

Under this new regulation, when evaluating a proof structured as an array of tuples (each containing a hash and a directional identifier like LEFT or RIGHT), any sequence interpreted as LEFT followed by another LEFT, or RIGHT followed by RIGHT, is now prohibited from being recognized as a valid transaction. This adjustment ensures that each 64-byte segment identified as a transaction must be positioned as a leaf within the tree structure. Such a configuration directly addresses and prevents potential security vulnerabilities where a transaction identifier (txid) could be falsely embedded within these 64-byte transactions, misleading Simplified Payment Verification (SPV) users.

This refinement in the validation rules is predicted to affect an extremely small fraction of blocks—approximately one in every two million. This frequency suggests that while the impact on the overall block processing might be minimal, the enhancement in security is crucial for maintaining trust and integrity within the blockchain system.