sequenceDiagram
autonumber
participant VR as Vault Repos
participant Dev as Developer
participant GH as GitHub CITo understand project and architecture, please see this README - https://github.com/MdSadiqMd/TraceZero
-
How to solve small user base
- If 3 users buy credits at 14:00, 14:05, 14:10, and 3 deposits arrive via Tor at 14:30, 14:35, 14:40, the relayer has a strong timing correlation. With a small user base it can be easily trackable
- And when there are two users in the pool it means there is 50% of chance of tracing the person, narrowing it down, how many users in the anonymity set is safe, and how to make sure the first user is not exposed ?
-
The deposit wallet needs SOL to fund pool deposits. Where does that SOL come from?, currently relayer operator periodically transfers funds from treasury → deposit wallet (off-chain), but this transfer is on-chain. How is the deposit wallet funded without creating an on-chain link to the treasury?
-
The client generates a new ephemeral X25519 key per deposit request. But the relayer's ECDH key is a StaticSecret generated once at startup and reused for ALL
Every user-facing flow in the system, traced end-to-end with full detail. Covers onboarding, deposits, limit orders, market orders, matching, settlement, cancellation, withdrawal, and the crank lifecycle. Each diagram shows every account touched, every validation performed, and every state change made.
Date: 2026-03-24 | Time: Session
Prompt: "Read docs/documentation.md to understand this project more, and from now write all prompts in docs/prompts.md with short summaries as a log."
Summary: Set up docs/prompts.md as a running log file. Read docs/documentation.md which contains comprehensive ZK proof documentation for ProveKit — 20 mathematical topics, 100+ interview questions, flowcharts, comparison tables, security considerations, and a glossary. Ready for next tasks.
ProveKit is a zero-knowledge proof toolkit optimized for mobile devices by the World Foundation.
ProveKit compiles Noir circuits (a domain-specific language for zero-knowledge proofs) into R1CS (Rank-1 Constraint System) constraints and generates/verifies WHIR proofs. The workflow is:
- Takes Noir circuits (written in the Noir language) as input
- Compiles them to R1CS constraint matrices using an optimized compiler
| [ | |
| { | |
| "offset_ms": 0, | |
| "wall_clock": "2026-03-09T09:13:39.099Z", | |
| "kind": "gossip_spread", | |
| "source_node": 8708844221495254261, | |
| "detail": "gossip round to 3 peer(s)" | |
| }, | |
| { | |
| "offset_ms": 0, |
sequenceDiagram
autonumber
participant W as User Wallet
participant D as dApp (Browser)
participant Tor as Tor Network
participant R as Relayer
participant T as Treasury Wallet
participant DW as Deposit Wallet