Transaction Details
| TX Hash | 96123e81c7f26df585eeab540028e91f3999d304123ece76def84c00fbe12a45 |
| Block | 11,425 |
| Timestamp | Sat, 14 Mar 2026 19:51:45 GMT (2d ago) |
| Confirmations | 16 |
| Fee | 0.01 USDm |
| Size | N/A |
| Weight | N/A |
| Version | 9 |
Transaction Type
| Type | TRANSFER |
Inputs & Outputs
| Inputs | 1 |
| Outputs | 2 |
| Ring Size | 1 |
| RingCT Type | 11 |
Note: Actual amounts and sender/recipient addresses are private (FCMP++). Only the transaction structure is visible on-chain.
FCMP++ Proof Transcript
| Proof Type | FCMP++ Full-Chain Membership Proof |
| Anonymity Set | Entire Chain (all outputs ever created) |
| Inputs | 1 |
| Proof Size | 4,000 bytes |
| Curve Tree | Selene (C1) dual-curve architecture |
| Tree Layers | 3 |
| Tree Root | b981fca6c68174a6f5d2f79d7ab0b7cacea8e0608b989718478921af1290292b |
Curve Tree Structure
Layer 0 (Leaves) : Ed25519 output tuples (O, I, C) → Selene (C1) hashes Layer 1 (Interior) : Selene (C1) → Helios (C2) commitments Layer 2 (Interior) : Helios (C2) → Selene (C1) commitments Layer 3 (Root) : Selene (C1) tree root
The full output set is committed into a Helios/Selene curve tree. Each leaf encodes an output tuple (O, I, C) as Selene curve points. Interior nodes alternate between Helios and Selene curves, enabling efficient recursive proof composition.
Input 0 — Membership Proof
| Key Image (Nullifier) | 9f8ebf6fb3a9d77cf8c64c5de61a80938c4c28fd6967ad111d9cbc39d1d7fb65 |
| C̃ (Pseudo-output) | 48f09ac465357bc07c9856a5224e25b6f7569139956044b45ade9d0ace440793 |
| Pseudo-out (Balance) | 5b1a3eb6510272cb4d2164e4534d7d0cc22982851bf8d9b76dcf3afa128488a3 |
Nullifier: The key image
KI = x · Hp(O) is a deterministic, unlinkable nullifier. It prevents double-spending without revealing which output is being spent.
Spend-Auth & Linkability (SAL) Proof
ÕRerandomized one-time key
ĨRerandomized linking tag
RRerandomization scalar
C̃Rerandomized Pedersen commitment
The SAL proof demonstrates knowledge of the secret spend key, correct key image formation, and that the balance equation holds: Σ pseudo-outs = Σ output commitments + fee.
Verification Pipeline
1Deserialize FCMP++ proof from transaction
2Extract tree root (Selene (C1)), layers, key images
3Reconstruct signable hash from tx prefix
4Verify Generalized Bulletproofs+ arithmetic circuit
5Verify Helios/Selene curve tree membership (per input)
6Verify SAL proof (spend authorization + linkability)
7Check key image uniqueness (double-spend prevention)
✓Consensus acceptance
Privacy Guarantees
Anonymity SetEntire chain
Sender PrivacyHidden among all outputs
Amount PrivacyPedersen + Bulletproofs+
Receiver PrivacyStealth addresses
Double-SpendDeterministic nullifiers
Curve CycleHelios (C2) ↔ Selene (C1)