Documents

Proofbase Whitepaper

A Proof-Based Blockchain for Low-Latency, Scalable, Multichain, Zero-Knowledge Applications
Secure, trustless, and cost-efficient validation of zero-knowledge proofs unlocks unbounded innovation in privacy, functionality, user-experience, and interconnectivity for blockchain-based applications.
Blockchains today impose application design limitations: expensive onchain compute, indiscriminately public processed information, and the ability to reason only about their own state. However, although zero-knowledge proofs are widely accepted as the solution, the complexity, cost, and rapid evolution of zero-knowledge protocols make integration and deployment challenging.

We introduce Lurk, a new LISP-based programming language for zk-SNARKs. Traditional approaches to programming over zero-knowledge proofs require compiling the desired computation into a flat circuit, imposing serious constraints on the size and complexity of computations that can be achieved in practice. Lurk programs are instead provided as data to the universal Lurk interpreter circuit, allowing the resulting language to be Turing-complete without compromising the size of the resulting proof artifacts. Our work describes the design and theory behind Lurk, along with detailing how its implementation of content addressing can be used to sidestep many of the usual concerns of programming zero-knowledge proofs.