Parallelized Merkle-Tree Validation in Proof-of-Work Mining

Based on DPoWW consensus, it is possible to parallelise validation payloads, critical for scaling miner throughput. While a statistical approach is possible in the future, a more secure and robust deterministic approach is detailed  here. The pair wise coverage of a fragmented Merkle Tree is described as well as Steiner Triple Systems approach trading off validation payload sze against number of mineres required to guarantee fault tolerance.