RESEARCH

The papers behind the protocol.

Nockchain is built on published work: a SNARK-friendly instruction set, a framework for compiling languages into verifiable virtual machines, a whitepaper for a proof-of-work chain that mines zero-knowledge proofs, and now Lockstep - bit-exact, verifiable transformer inference. Everything here is open for review.

Latest
Nockchain ResearchPreprint v0.2.0
September 10, 2026

Lockstep: Bit-Exact, Verifiable Transformer Inference at Parity Across Devices, for Dense and Mixture-of-Experts Models

Perica Glavas · Maksym Yakovenko · Logan Allen

Production transformer serving has no single correctness relation at the bit level: equivalent kernels, reduction orders, batch compositions, compilers and devices all legitimately return different floating-point strings, so an auditor must either reproduce the provider's environment or accept a tolerance. Lockstep makes the served inference function itself canonical. A versioned contract fixes every implementation-selected floating-point choice, and correctness becomes bit equality to a public function that an optimized serving engine and a portable CPU reference evaluate alike. Implemented as a vLLM plugin, five dense model families serve at or above stock throughput and Qwen3-30B-A3B at 1.32-1.37x, with identical output digests across Hopper, Ada and Blackwell GPUs and the reference reproduced bit for bit on x86 and ARM. The contract core is mechanized in Lean 4.

WhitepaperNockchain
April 30, 2026

Nockchain: A Distributed Market for Verifiable Computation

Logan Allen · Justin Murphy

Nockchain is a Proof-of-Work blockchain whose mining produces zero-knowledge proofs of state transitions rather than discarded hashes. Under ZK-PoW consensus, miners generate STARK proofs over the NockVM, so the energy that secures the chain also subsidizes a global market for verifiable computation. Applications run off-chain as NockApps and settle on the shared base layer with succinct proofs whose verification cost is effectively constant, decoupling scalability from consensus without fragmenting composability. $NOCK is hard-capped at 2^32 units and minted exclusively through ZK-PoW, with no premine and no founder allocation.

IACR ePrint2025/1110
June 2025

A Framework for Compiling Custom Languages as Efficiently Verifiable Virtual Machines

Assimakis A. Kattis · Brian Klatt · Philip Quirk · Logan Allen

A framework for compiling languages into efficient Interactive Oracle Proofs, motivated by verifiable virtual machine (zkVM) design. The paper establishes the conditions under which a language admits an efficient IOP compilation, identifies a traversable subclass of languages that satisfies them, and demonstrates the approach with a zkVM for the Nock programming language whose circuit performs comparably to state-of-the-art zkVM designs.

IACR ePrint2023/1021
June 2023

EDEN: A Practical, SNARK-Friendly Combinator VM and ISA

Logan Allen · Brian Klatt · Philip Quirk · Yaseen Shaikh

Most zkVMs emulate a von Neumann architecture and must prove relations between a program's execution and its use of random-access memory. Nock is a minimal, homoiconic, Turing-complete combinator function that is naturally modeled in a SNARK yet practical for general computation. EDEN, an Efficient Dyck Encoding of Nock, is a SNARK-friendly combinator function and instruction set architecture: the paper describes the arithmetization techniques and polynomial equations that represent the EDEN ISA in an Interactive Oracle Proof, and presents the EDEN zkVM as a zk-STARK instantiation.