zk-fabric-rs
Polylithic Syntax ZK Joint Proof System
About
The problem it solves # Problems : ZK Scalability **Secure computation is powerful** — *but hard to scale, verify, or make transparent in practice.* Existing systems that rely on centralized processing, unverifiable results, or interactive zero-knowledge proofs suffer from, - Opaque Evaluation: How can we trust that a computation was executed correctly without revealing its inputs? - Monolithic Circuits: Large circuits are hard to manage, deploy, or audit — especially in decentralized environments. - Lack of Verifiability: Users have no way to verify whether their inputs contributed to the correct result. - Heavy Interaction: Most secure multi-party computation or ZK proof systems require live interaction between participants. Here's a comparison chart of zk-fabric with other zk proving systems like zkSNARK, zkSTARK, bulletproofs, zkBOO and zkBOO++ : | Feature / Protocol | zk-fabric (yours) | zk-SNARKs | zk-STARKs | Bulletproofs | ZKBoo | ZKBoo++ | | ------------------------ | ---------------------------------------------------- | ----------------------------------- | ----------------------------- | ---------------------------------------- | --------------------------- | ---------------- | | **Interactivity** | Non-interactive (partitioned GC + publish) | Non-interactive | Non-interactive | Non-interactive | Interactive | Interactive | | **Trusted Setup** | ❌ None | ✅ Needs setup | ❌ None | ❌ None | ❌ None | ❌ None | | **Post-Quantum Secure** | ✅ (GC + XOR masking) | ❌ (Pairings) | ✅ (Hash-based) | ✅ (Hash-based) | ✅ (Symmetric) | ✅ (Symmetric) | | **Verifier Cost** | ✅ Lightweight | ✅ Very low | ⚠️ Higher | ✅ Efficient | ⚠️ Costly | ⚠️ Costly | | **Prover Cost** | ✅ Moderate (can parallelize) | ⚠️ High | ⚠️ Very high | ⚠️ Moderate | ✅ Fast | ✅ Fast | | **Proof Size** | ⚠️ Large (Garbled Circuits) | ✅ Small | ⚠️ Large | ✅ Small | ⚠️ Large | ⚠️ Large | | **Input Privacy** | ✅ Built-in (GC model) | ✅ | ✅ | ✅ | ✅ | ✅ | | **Application Scope** | Protocol execution & logic verification | Arithmetic Circuits | Large-scale batch computation | Confidential assets (e.g., MimbleWimble) | Boolean circuits | Boolean circuits | | **Transparency** | ✅ Public outputs + keys | ⚠️ Depends on setup | ✅ Fully transparent | ✅ Fully transparent | ✅ Transparent | ✅ Transparent | | **Partitioning Support** | ✅ Built-in | ❌ | ❌ | ❌ | ❌ | ❌ | | **Use Case Fit** | Protocol verification, low-trust distributed systems | zk-rollups, identity, privacy coins | Auditable computation, zkVMs | Confidential txs | Authenticated Boolean logic | Optimized ZKBoo | # Use cases: ### REAL TIME PROVING OF PRIVACY & POLICIES IN PRIVACY PRESERVING CONSUMER APPLICATION ### SYSTEM PRONES TO ADVERSARY WITH ACCESS OF THE SECRET RANDOMNESS USED TO GENERATE PARAMETERS
How it's made
Challenges we ran into # Programmable Challenges 1. Serialization Hell (Serde + Circuit Structures) 2. Garbled Circuit Return Type Confusion 3. Mocking Oblivious Transfer Without Breaking Flow 4. Partitioning Semantics