The Cryptographic Treatise — Vellum Cash GitBook

§Tractatus § I: Deterministic Ephemeral Conduit Formulation#

“The first breach of a ledger is the persistence of an address. Vellum establishes an ephemeral point of ingress, then severs it from the visible grammar of settlement.”

THEOREM I: Zero Address Linkability

∀ a(in) in Wallets, P(a(in) → a(out)) = 0 [ZK-VERIFIED]

#### Proof Sketch:

Let a(in) be an ingress address generating commitment C = Poseidon(r, v, s). The commitment is added to an incremental Merkle tree accumulator T of size N.

The spend authorization is executed via a zero-knowledge argument of knowledge π asserting:

∃ (r, v, s, path) s.t. MerkleVerify(R, Poseidon(r, v, s), path) = 1

Because π satisfies the Perfect Zero-Knowledge property, the distribution of π can be simulated by an expected polynomial-time algorithm without access to (r, v, s) or path. Consequently, the conditional mutual information between a(in) and the egress transaction E(a(out)) satisfies:

I(a(in); a(out) | π) = 0

Hence, no observer can distinguish the true ingress source from any of the N members of the accumulator set. blacksquare

§Tractatus § II: Polynomial Commitments & Nullifier Sets#

“Within the Arc Blockchain, a deposit becomes a commitment and a nullifier becomes its proof of absence. Merkle inclusion proofs verify integrity without exposing source, timestamp, or recipient relationship.”

AXIOM II: Cryptographic Commitment Formulation

Commitment: C = Poseidon(r, v, s)

Nullifier: η = Poseidon(k, nullifier\_secret)

#### Properties Enforced by the Circuit:

Collision Resistance: Finding two distinct tuples (r, v, s) neq (r', v', s') such that Poseidon(r, v, s) = Poseidon(r', v', s') requires finding collisions in Poseidon over F_q, which requires O(2^(128)) operations.

Unlinkability of η and C: Deriving C from η requires inverting the one-way permutation of Poseidon, which is computationally intractable under the discrete log assumption.

§Tractatus § III: Abolition of Chain Graph Surveillance#

“Counter-heuristics are not obfuscation; they are structural independence. Variable delay, uneven sharding, and independent relayers dissolve the predictable edges that clustering tools depend upon.”

THEOREM III: Heuristic Severance Operator

HEURISTIC\_SEVERANCE: Poisson(Δ t) ⊗ Sharded\_Tranches[1..n]

By convolving a stochastic Poisson delay kernel with multi-tranche liquidity sharding, the cross-correlation matrix between ingress parameters (t(in), V(in)) and egress parameters (t(out), V(out)) approaches the entropy of a uniform distribution over the anonymity set.