The layout of the Merkle tree as originally found in Bitcoin does not lend itself to incremental embarrassingly parallel processing, which will become a hindrance if the blocks are to become large in the future.
Thus, we propose the Merklix tree, a change of the consensus rule that impacts the hashing strategy for a block. The Merklix tree is a bitwise trie supplemented by a Merkle overlay.
The tree lends itself to incremental embarrassingly parallel calculations, and it also maximally preserves the backward compatibility with existing applicative landscape of Bitcoin.
