[BIP Draft] Segregated Data: a prunable, script-isolated block region for data carriage

The recent update to the Bitcoin Improvement Proposal (BIP) introduces a standardized consensus validation process known as Uniform Validation. This mechanism ensures that the validation of blocks is consistent across all network depths, maintaining the same validation criteria whether a block is at the chain's tip or subject to the deepest reorganization. Under this system, each node applies the same rules from the initial base serialization, which includes the examination of transactions and the coinbase commitment. Notably, the validity of a block is determined at the moment it is first seen, and this status remains unchanged, eliminating the possibility for nodes to have differing opinions on a block due to encountering it at varying depths. The principle here is that consensus should never rely on variable data; instead, all validations are treated merely as relay policies except for the commitment checks.

Furthermore, an economic model has been incorporated into the proposal to incentivize the relocation of certain types of data out of the witness segment. This model is articulated through a table that outlines the savings in weight units (WU) and virtual bytes (vB) achieved by using SegData compared to traditional methods. For example, handling 256 bytes of data through SegData results in a saving of approximately 473 WU or about 39% compared to older models. As data payloads increase to 1 KB, 10 KB, and 100 KB, the savings percentage improves to 44%, 49%, and 50% respectively. This structured approach not only streamlines data handling but also addresses economic efficiency, particularly noting that OP_RETURN becomes unsuitable for larger data sizes due to economic irrationality, thus supporting the use of alternative vectors for carrying significant data payloads.