Proof of Necessary Work Enables Ultra-Light Client Trustless Blockchain Verification
PoNW integrates SNARK proof generation into Proof-of-Work, transforming mining energy into chain-knowledge arguments for stateless, constant-time verification.
Matrix Multiplication Enables Truly Useful Proof-of-Work with Negligible Overhead
The cuPOW protocol transforms AI's matrix multiplication bottleneck into a secure, energy-efficient Proof-of-Work primitive with near-zero computational overhead.
Verifiable Delay Puzzles Enable Fair Energy-Efficient Nakamoto Consensus
The Verifiable Delay Puzzle (VDP) replaces energy-intensive Proof-of-Work with a sequential-only computation, ensuring fair, decentralized block production.
Sequential Proof-of-Work Enables Competitive Decentralized Randomness Beacons
RandChain introduces Sequential Proof-of-Work to mandate non-parallelizable mining, securing public randomness and democratizing validator election.
Homogeneous Weight Functions Secure Multi-Resource Longest-Chain Consensus
A mathematical classification of resource-weighting functions secures longest-chain protocols, ensuring persistence against private double-spending attacks.
Formalizing Multi-Resource Weight Functions Secures Next Generation Nakamoto Consensus
Researchers formalized secure resource weighting for longest-chain consensus, enabling new hybrid proofs to counter centralization and enhance security models.
