The Vauban Proof Stack Framework (VPSF) defines a composable claim algebra; a chain-agnostic formal grammar for cryptographic claims that operates above any settlement layer. The core specification contains no blockchain-specific types: chain adapters implement the grammar for each target environment. Today's reference implementation anchors on Starknet via ZK-STARK proofs; hash-based, post-quantum-secure, no trusted setup. The same grammar already expresses six classes of claim: personhood, agentic authority, knowledge and decision provenance, process and computation integrity, financial attestation, and state and artifact provenance. One grammar, six classes, composable across trust roots.
The architecture preserves institutional sovereignty at the specification level: no vendor lock-in by invariant, not just by policy. Claims produced today against Starknet are consumable by future adapters targeting other settlement environments. An IETF Internet-Draft to standardise the Vauban Claim Algebra is in preparation, following the precedent of RFC 9449 (DPoP) and W3C Verifiable Credentials. Starknet's STRK20 delivers value-privacy on-chain ; it hides who paid whom and how much ("follow the money"). Vauban operates on a different axis ; it proves attributes about a subject without revealing identity, and composes those proofs across domains ("prove the actor"). The two are complementary: an anonymous on-chain action can be gated on a Vauban claim that the actor is a unique human or an eligible party.
Architecture invariant VPSF is chain-agnostic by invariant. Starknet is the current reference implementation (ZK-STARK, no trusted setup). Multi-chain adapters are in research; first non-Starknet testnet target Q3 2027.
Invariant Chain-agnostic by design
Current impl. Starknet-anchored, ZK-STARK proof system
Multi-chain adapters In research (Q3 2027 testnet target)
Settlement layer Starknet (mainnet live)
Open standard x402: I-D submitted (ISE) · Claim Algebra: in preparation