The Architecture of Digital Trust.
Privacy-preserving verification and quantum-ready cryptographic infrastructure for the next generation of onchain finance.
Three layers, and what may cross them.
Private
- identity secret
- credential claims and salts
- Merkle path
- Ed25519 keys (non-extractable)
a proof, a signature, a presentation of chosen claims
Protocol
- Poseidon commitment trees
- ML-DSA and ML-KEM keys in custody
- versioned policies
- signed status lists
roots, decisions, attestations
Public
- published roots
- spent nullifiers
- key versions
- verification results
nothing further: this is the record
A verifier learns the statement, not the witness.
Six Noir circuits prove facts about credentials held in Poseidon commitment trees. The proof is 8,768 bytes and verifies on-chain for about 2.66 million gas.
- The verifier learns
- that the holder is in the issuer’s tree, that the credential is current, that a hidden value clears a threshold, and a nullifier that makes the claim usable once per scope.
- The verifier never receives
- the identity secret, the attribute, the salt, the leaf position or the path. QuantLayer proves facts about credentials; it does not make transactions private.
FIPS 203, 204 and 205, implemented in Rust.
ML-DSA and SLH-DSA sign; ML-KEM establishes keys. Ethereum accounts remain ECDSA and are not quantum-resistant, so on-chain post-quantum checks are attested by a quorum.
| Algorithm | Standard | NIST category | Public key | Signature | Sign | Verify |
|---|---|---|---|---|---|---|
| ML-DSA-44 | FIPS 204 | 2 | 1,312 B | 2,420 B | 112 µs | 31 µs |
| ML-DSA-65 | FIPS 204 | 3 | 1,952 B | 3,309 B | 156 µs | 46 µs |
| ML-DSA-87 | FIPS 204 | 5 | 2,592 B | 4,627 B | 192 µs | 70 µs |
| SLH-DSA-SHA2-128s | FIPS 205 | 1 | 32 B | 7,856 B | 877 ms | 742 µs |
| SLH-DSA-SHA2-128f | FIPS 205 | 1 | 32 B | 17,088 B | 39 ms | 2.2 ms |
| SLH-DSA-SHA2-256s | FIPS 205 | 5 | 64 B | 29,792 B | 1,323 ms | 1.6 ms |
An identifier that proves its own origin.
A did:quantlayer is derived from its inception key and a single-use challenge. Keys rotate, including from Ed25519 to ML-DSA-65, without changing the identifier.
Identity lifecycledid:quantlayer:base32(
SHA-256(algorithm, public key, nonce)
)
- pending
- active
- rotated
- deactivated
Policies decide; nine steps prove it.
{
"id": "treasury.transfer",
"version": 3,
"mode": "hybrid",
"hybrid": { "schemes": ["Ed25519+ML-DSA-65"] },
"binding": {
"chainIds": ["42161"],
"appDomains": ["treasury.example.com"],
"actions": ["treasury.*"]
},
"limits": { "maxLifetimeSeconds": 300 }
}- 01request
- 02evidence
- 03policy
- 04binding
- 05time
- 06revocation
- 07subject
- 08verification
- 09replay
Seven contracts, one verifier per circuit.
Solidity 0.8.28, role-separated access control, every address fingerprinted against its build before the SDK will call it.
Protocol architectureArbitrum first, Robinhood Chain beside it.
| Network | Chain ID | Environment | Explorer |
|---|---|---|---|
| Arbitrum One | 42161 | Mainnet | arbiscan.io |
| Arbitrum Sepolia | 421614 | Testnet | sepolia.arbiscan.io |
| Robinhood Chain | 4663 | Mainnet | robinhoodchain.blockscout.com |
| Robinhood Chain Testnet | 46630 | Testnet | explorer.testnet.chain.robinhood.com |
One client, ten modules.
@quantlayer-protocol/sdk runs the same protocol code the API verifies: ESM and CommonJS, browser-safe, typed contract calls.
npm install @quantlayer-protocol/sdkimport { createQuantLayerClient, generateEd25519Signer } from '@quantlayer-protocol/sdk';
const quantlayer = createQuantLayerClient({
api: {
baseUrl: 'https://api.quantlayer.example',
apiKey: process.env.QUANTLAYER_API_KEY,
},
});
// The DID is derived locally from the key and a single-use challenge.
const { signer } = generateEd25519Signer('k1');
const { did } = await quantlayer.identity.create({ signer });Four rules the code enforces.
- 1
Keys stay with their owner
No private key is accepted, stored or logged by a QuantLayer backend. Custody keys never leave the Rust module unsealed.
- 2
One signature, one operation
Every signed authorization is bound to one action, one subject, one service and one short-lived nonce.
- 3
Fail closed
Unknown algorithms, missing evidence and incompatible protocol versions are refusals, never fallbacks.
- 4
Say the trust assumption
Post-quantum verification on-chain is attested by a quorum, not trustless. Every result names its assurance.