MetaTxID Technical Explanation

BRIEF DESCRIPTION OF TECHNICAL PRINCIPLES

Specifically, the TXID scheme generated by the transaction format is improved to the following figure:

FEATURES

Because of the irreversibility of TXID calculation, the use of TXID is almost only to index TX data. The core requirement is that different transactions need to generate different TXIDs. Therefore, the calculation of TXID has low coupling and high independence. It only needs to use new calculation logic in all positions that need to calculate or verify TXID. It will not affect any other part of the program logic, and will not affect miners' use of the full text of transaction data (including Key and Lock) for script verification without affecting SPV (Simple Payment Verification) and so on. In conjunction with the upgraded TX Version, different TXID calculation functions are required to mark transactions of the new and old versions. The old and new transactions can coexist at the same time without conflicts. The ecological application side does not need to change any other verification units, and only needs to add a new version of the TXID calculation function. This solution is a continuation of Merkle Path's data pruning design, which is applied to TX to form a complete data pruning requirement. In particular, once the key data is verified and uploaded to the chain by the miners, its SPV will have sufficient security to ensure that the key data can be safely removed even if it is extremely large.

This change is a necessary part of the development direction of large blocks. Large TXs and large script execution capabilities are bound to be encouraged in large blocks. As the script program gets bigger and bigger, the storage space it needs (the paper tape in the Turing machine) will also get bigger and bigger. For example, modern computer programs must do memory garbage collection to maintain the usefulness of Turing machines. This improvement also achieves the full use of the paper tape under the objective condition of limited paper tape, so that the Turing ability of the Bitcoin script can be maximized, and the essential resource recovery (data clipping) ability can be obtained. This improvement enhances or complements the genetic and evolutionary capabilities of transaction data, opening up infinite possibilities for the evolution of similar organisms for the Bitcoin system. In analogous organisms, when diploid cells undergo meiosis to produce haploid gametes (sperm and eggs), a portion of chromosomes are assigned to polar bodies, which are then usually degraded. Imagine that if some chromosomes are not discarded, organisms will not be able to evolve. Mutation and garbage cleaning are necessary capabilities. For any Bitcoin transactions that need to self-evolve, the ability to mutate is achieved by Turing-complete computer instructions, and the ability to clean up garbage is implemented by this proposal which must clean up (or archive) the obsolete and useless parts while retaining (or activating) the useful data.