Zero-Knowledge Proof
Ayrıca şöyle anılır ZKP, Zero-Knowledge Protocol
What it is. A zero-knowledge proof lets one party (the "prover") convince another (the "verifier") that a statement is true, without revealing why it's true or any information beyond the bare fact of its truth. The classic illustration: imagine a circular cave with a locked door connecting its two paths, and you claim to know the door's password. You can prove it to a skeptic standing outside, by entering one path at random and, when they call out which path to exit from, always coming back that way, without ever saying the password aloud, and without the skeptic learning anything except "yes, they knew it." Repeat enough times and the chance you were guessing becomes negligible.
Formally, a zero-knowledge proof needs three properties: completeness (a true statement can always be proven), soundness (a false statement can't be proven, except with vanishing probability), and zero-knowledgeness (the verifier learns nothing beyond the statement's truth, no cheat, no shortcut, no side information).
Who built it. Shafi Goldwasser, Silvio Micali, and Charles Rackoff defined zero-knowledge proofs formally in 1985. The idea sat mostly in theory for two decades before practical, fast constructions arrived: Groth16 zk-SNARKs (Jens Groth, 2016) and Bulletproofs (Bünz, Bootle, Boneh, Poelstra, Wuille, and Maxwell, 2018) are the two most widely deployed families today, alongside the older "sigma protocol" style of interactive proof that BBS+ signatures use for selective disclosure.
How Solidus uses it. The BBS+ implementation this section describes is UNAUDITED, external audit targeted H2 2026 via NLnet NGI Zero, and nothing here is a production assurance until it lands. With that said: every BBS+ credential presentation Solidus issues is a zero-knowledge proof, specifically, a zero-knowledge proof of knowledge that the holder possesses a validly-signed credential, without revealing the credential's hidden message fields or letting the proof be linked to any other presentation from the same credential. That is a real, running, testnet-grade ZKP, not a marketing gloss.
What is not shipped is the broader zero-knowledge layer Solidus's protocol whitepaper describes: general-purpose Groth16 zk-SNARK circuits for arbitrary predicates ("prove your age is over 18 without revealing your birthdate," "prove your balance exceeds X"). Those circuits are specified on paper, with a defined statement and public inputs, but no package or product ships them today. See Predicate Proof for the honest state of that half.
Check it yourself. npm i @solidus-network/auth @solidus-network/bbs, then run the bundled demo/unlinkability-demo.mjs. It issues a real credential in the production format, presents it twice, verifies both presentations, and prints the pooled correlation surface plus a stated honesty boundary, no Solidus account or repo access required.
Nereden geliyor
Bunu başkası belirtti. Solidus bir araya getiriyor.
Invented by Shafi Goldwasser, Silvio Micali, and Charles Rackoff, defined in their 1985 paper "The Knowledge Complexity of Interactive Proof Systems" (Goldwasser and Micali later shared a Turing Award, in part, for this line of work). Every zero-knowledge construction used today, zk-SNARKs, zk-STARKs, Bulletproofs, the sigma protocols inside BBS+, builds on their original definition. Solidus did not invent any zero-knowledge construction; it composes existing ones, and has actually shipped only one of several it has written down.
Bunu nasıl doğrularsınız
Test ağında çalışıyor. Ana ağda değil.
npm i @solidus-network/auth @solidus-network/bbs node node_modules/@solidus-network/auth/demo/unlinkability-demo.mjs, the demo issues a credential, presents it twice, verifies both, and prints its own honesty boundary in the output.