Computetoken.Net

Research on implementing approximate and Monte Carlo common coins in asynchronous Byzantine systems without trusted setup, achieving O(n³log n) communication complexity for binary Byzantine agreement.

Analysis of quantum computing's quadratic advantage in Proof of Work mechanisms, covering security implications for blockchain and economic incentives for quantum mining.

Analysis of quantum computing risks to Bitcoin's cryptographic security, including proof-of-work resilience, elliptic curve vulnerability, and quantum-resistant solutions.

Study of maximal coin-position entanglement generation in discrete-time quantum walks using optimized coin sequences, with experimental validation and applications in quantum information processing.