1"use strict";(self.webpackChunkverifik_documentation=self.webpackChunkverifik_documentation||[]).push([["17574"],{32182(e,n,r){r.r(n),r.d(n,{metadata:()=>s,default:()=>h,frontMatter:()=>o,contentTitle:()=>c,toc:()=>a,assets:()=>l});var s=JSON.parse('{"id":"getting-started/zelf-proofs-vs-others","title":"Zelf Proofs vs Others","description":"In the last decade, many ZK-proof solutions have been born with applications in the blockchain industry. Some developers may ask, what\'s the difference between Zelf Proof and the conventional open-source ZK solutions? Here we present a breakdown for each technology, pointing out their differences, applications, and limits. ","source":"@site/docs/getting-started/zelf-proofs-vs-others.md","sourceDirName":"getting-started","slug":"/getting-started/zelf-proofs-vs-others","permalink":"/getting-started/zelf-proofs-vs-others","draft":false,"unlisted":false,"editUrl":"https://github.com/Open-Verifik/verifik-documentation/tree/main/docs/getting-started/zelf-proofs-vs-others.md","tags":[],"version":"current","frontMatter":{}}'),i=r(74848),t=r(28453);let o={},c="Zelf Proofs vs Others",l={},a=[{value:"Breakdown",id:"breakdown",level:3}];function d(e){let n={br:"br",h1:"h1",h3:"h3",header:"header",p:"p",strong:"strong",...(0,t.R)(),...e.components},{Details:r}=n;return r||function(e,n){throw Error("Expected "+(n?"component":"object")+" `"+e+"` to be defined: you likely forgot to import, pass, or provide it.")}("Details",!0),(0,i.jsxs)(i.Fragment,{children:[(0,i.jsx)(n.header,{children:(0,i.jsx)(n.h1,{id:"zelf-proofs-vs-others",children:"Zelf Proofs vs Others"})}),"\n",(0,i.jsx)(n.p,{children:"In the last decade, many ZK-proof solutions have been born with applications in the blockchain industry. Some developers may ask, what's the difference between Zelf Proof and the conventional open-source ZK solutions? Here we present a breakdown for each technology, pointing out their differences, applications, and limits. "}),"\n",(0,i.jsx)(n.h3,{id:"breakdown",children:"Breakdown"}),"\n",(0,i.jsxs)(r,{children:[(0,i.jsx)("summary",{children:"Zelf Proof (ZK- Face Proofs\u2122)"}),(0,i.jsxs)(n.p,{children:[(0,i.jsx)(n.strong,{children:"Definition"}),(0,i.jsx)(n.br,{}),"\n","Non-interactive, Highly scalable, small proof size, trusted setup through licensing mechanism."]}),(0,i.jsxs)(n.p,{children:[(0,i.jsx)(n.strong,{children:"ZelfProof"})," (ZK- Face Proofs\u2122) technology does not rely on conventional zero-knowledge proofs (ZKPs). Yet, it achieves the same objective: verifying the authenticity of a face without revealing any biometric information. By generating a unique ZelfProof, this enables someone to encrypt information with their face without disclousing the face to any third party. the ",(0,i.jsx)(n.strong,{children:"ZelfProof"})," does not disclose the face data in any moment. This ensures privacy-preserving and secure identity verification without the need to expose or store biometric data."]}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Trusted Setup"})}),(0,i.jsx)(n.p,{children:"Trusted setup through a licensing mechanism"}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Interactivity"})}),(0,i.jsx)(n.p,{children:"Non-interactive, can be verified offline"}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Proof Size"})}),(0,i.jsx)(n.p,{children:"~ 2- 3kb and 60 kb in QR format"}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Verification Time"})}),(0,i.jsx)(n.p,{children:"Fast, runs on mobile as well"}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Scalability"})}),(0,i.jsx)(n.p,{children:"Highly scalable as it can run on the mobile directly without any server computation"}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Security Assumptions"})}),(0,i.jsx)(n.p,{children:"ZelfQRs are based on Elliptic Curve cryptography. Face Certificates will soon be quantum-safe."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Post-Quantum Security"})}),(0,i.jsx)(n.p,{children:"Face Certificates PQC version are quantum-safe. "}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Complexity"})}),(0,i.jsx)(n.p,{children:"Simple SDK"}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Transparency"})}),(0,i.jsx)(n.p,{children:"Trusted setup through a licensing mechanism (not fully transparent)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Use Cases"})}),(0,i.jsxs)(n.p,{children:["Verification of functional eID attributes (eKYC) ",(0,i.jsx)(n.br,{}),"\n","Proof of presence and unique humanness ",(0,i.jsx)(n.br,{}),"\n","Face-based transaction authentication ",(0,i.jsx)(n.br,{}),"\n","Face-based signup ",(0,i.jsx)(n.br,{}),"\n","Face-based login ",(0,i.jsx)(n.br,{}),"\n","Face-based document/file/disk encryption ",(0,i.jsx)(n.br,{}),"\n","Face-based document/file signing ",(0,i.jsx)(n.br,{}),"\n","National IDs/eID with Offline/Online ",(0,i.jsx)(n.br,{}),"\n","Verification Wallet Security"]}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Suitability for Blockchain"})}),(0,i.jsxs)(n.p,{children:[(0,i.jsx)(n.strong,{children:"ZelfProofs"})," can be integrated into an identity blockchain, such as HyperLedger Indy, via the ZelfEncrypt Distributed Ledger Technology (DLT) protocol. This allows for secure, privacy-preserving identity verification on the blockchain without exposing or storing sensitive biometric data."]})]}),"\n",(0,i.jsxs)(r,{children:[(0,i.jsx)("summary",{children:"zk Proof"}),(0,i.jsx)(n.p,{children:"A general class of zero-knowledge proofs where one party proves the validity of a statement without reveal
1ing information."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Trusted Setup"})}),(0,i.jsx)(n.p,{children:"It depends on the specific protocol, typically interactive."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Interactivity"})}),(0,i.jsx)(n.p,{children:"Often interactive (multiple rounds of communication between prover and verifier)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Proof Size"})}),(0,i.jsx)(n.p,{children:"It can be large depending on the complexity of the proof."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Verification Time"})}),(0,i.jsx)(n.p,{children:"It can be slow and depends on the size of the proof and computation."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Scalability"})}),(0,i.jsx)(n.p,{children:"Limited, especially for large computations."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Security Assumptions"})}),(0,i.jsx)(n.p,{children:"Varies, are often based on standard cryptographic assumptions."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Post-Quantum Security"})}),(0,i.jsx)(n.p,{children:"Depends on the cryptographic primitives used (most are not quantum-safe)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Complexity"})}),(0,i.jsx)(n.p,{children:"Generally simple, but requires multiple rounds of interaction."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Transparency"})}),(0,i.jsx)(n.p,{children:"Varies based on the protocol."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Use Cases"})}),(0,i.jsx)(n.p,{children:"Privacy-preserving authentication, data sharing, etc."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Suitability for Blockchain"})}),(0,i.jsx)(n.p,{children:"Limited; typically not used directly in blockchains due to larger proof sizes and interactivity."})]}),"\n",(0,i.jsxs)(r,{children:[(0,i.jsx)("summary",{children:"zk SNARK"}),(0,i.jsx)(n.p,{children:"Succinct, non-interactive zero-knowledge proofs with small proof sizes and fast verification."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Trusted Setup"})}),(0,i.jsx)(n.p,{children:"Yes (requires trusted setup)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Interactivity"})}),(0,i.jsx)(n.p,{children:"Non-interactive (once the proof is generated, no further interaction is needed)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Proof Size"})}),(0,i.jsx)(n.p,{children:"Small (a few hundred bytes)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Verification Time"})}),(0,i.jsx)(n.p,{children:"Very fast verification."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Scalability"})}),(0,i.jsx)(n.p,{children:"Less scalable for very large computations."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Security Assumptions"})}),(0,i.jsx)(n.p,{children:"Based on elliptic curve cryptography (ECDLP), not quantum-safe."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Post-Quantum Security"})}),(0,i.jsx)(n.p,{children:"No (vulnerable to quantum attacks due to reliance on elliptic curve cryptography)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Complexity"})}),(0,i.jsx)(n.p,{children:"More complex due to elliptic curve math and trusted setup."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Transparency"})}),(0,i.jsx)(n.p,{children:"Requires trusted setup (not fully transparent)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Use Cases"})}),(0,i.jsx)(n.p,{children:"Privacy-focused systems like Zcash, and identity proofs."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Suitability for Blockchain"})}),(0,i.jsx)(n.p,{children:"Widely used for privacy in blockchain applications (e.g., Zcash)."})]}),"\n",(0,i.jsxs)(r,{children:[(0,i.jsx)("summary",{children:"zk STARK"}),(0,i.jsx)(n.p,{children:"Scalable, transparent zero-knowledge proofs designed for large computations, with no trusted setup."}),(0,i.jsxs)(n.p,{children:[(0,i.jsx)(n.strong,{children:"Trusted Setup"})," "]}),(0,i.jsx)(n.p,{children:"No (transparent, no trusted setup)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Interactivity"})}),(0,i.jsx)(n.p,{children:"Non-interactive (like ZK-SNARKs)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Proof Size"})}),(0,i.jsx)(n.p,{children:"Large (kilobytes to megabytes)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Verification Time"})}),(0,i.jsx)(n.p,{children:"Fast verification, but slightly slower than SNARKs for small proofs."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Scalability"})}),(0,i.jsx)(n.p,{children:"Highly scalable, handles large computations efficie
1ntly."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Security Assumptions"})}),(0,i.jsx)(n.p,{children:"Based on hash functions (quantum-safe)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Post-Quantum Security"})}),(0,i.jsx)(n.p,{children:"Yes (resistant to quantum attacks)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Complexity"})}),(0,i.jsx)(n.p,{children:"Simpler than SNARKs, no setup needed, uses basic hash functions."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Transparency"})}),(0,i.jsx)(n.p,{children:"Fully transparent (no trusted setup required)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Use Cases"})}),(0,i.jsx)(n.p,{children:"Blockchain scaling, large-scale computations (e.g., StarkWare)."}),(0,i.jsx)(n.p,{children:(0,i.jsx)(n.strong,{children:"Suitability for Blockchain"})}),(0,i.jsx)(n.p,{children:"Best suited for blockchain scaling and high throughput DApps (e.g., layer-2 solutions)."})]})]})}function h(e={}){let{wrapper:n}={...(0,t.R)(),...e.components};return n?(0,i.jsx)(n,{...e,children:(0,i.jsx)(d,{...e})}):d(e)}},28453(e,n,r){r.d(n,{R:()=>o,x:()=>c});var s=r(96540);let i={},t=s.createContext(i);function o(e){let n=s.useContext(t);return s.useMemo(function(){return"function"==typeof e?e(n):{...n,...e}},[n,e])}function c(e){let n;return n=e.disableParentContext?"function"==typeof e.components?e.components(i):e.components||i:o(e.components),s.createElement(t.Provider,{value:n},e.children)}}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.