DFTWS: Deterministic, Fair, and Transparent Winner Selection for the Useful Work Blockchain Gophy
Felix Willi Hoffmann · Distributed Ledger Technologies Research and Practice · 2025
This publication presents a novel cryptographic commit scheme named DFTWS which is used to enable deterministic, fair, and transparent winner selection in an open source Proof-of-Useful-Work blockchain for High Energy Physics (HEP) called gophy. In gophy, instead of spamming hashing operations to mine blocks, miners are running computationally expensive Monte Carlo simulations to support a real-world HEP experiment with necessary data required to conduct the experiment. To preserve the usefulness property, block problems are defined over time by a Root Authority which is coordinated by a representative of a real-world HEP experiment. In order to be able to provide a transparent mechanism that allows for fair block winner selection from a list of eligible miners that solved a block problem, DFTWS is employed to achieve consensus between nodes. A strength of this approach is that every node is able to verify the fairness of the winner selection process. This publication provides an in-depth description and theoretical fairness analysis of DFTWS, a practical evaluation of its performance under real-world conditions and considerations of potential bottlenecks that can potentially occur as the node network scales. It also discusses a deployment strategy for using DFTWS on top of existing blockchain infrastructure like the Ethereum network. Additionally, theoretical performance aspects of DFTWS are compared with various state-of-the-art cryptographic commitment schemes and Zero-Knowledge Proof systems.