Transaction Details
| TX Hash | a7f7a97c417fb0adc836457761a38fd1b7f79058ee10fe40a7c3f735d2257b6c |
| Block | 11,428 |
| Timestamp | Sun, 15 Mar 2026 04:32:31 GMT (1d ago) |
| Confirmations | 13 |
| Fee | 0.5 USDm |
| Size | N/A |
| Weight | N/A |
| Version | 9 |
Transaction Type
| Type | TRANSFER |
Inputs & Outputs
| Inputs | 2 |
| 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 | 2 |
| Proof Size | 5,248 bytes |
| Curve Tree | Selene (C1) dual-curve architecture |
| Tree Layers | 3 |
| Tree Root | c11d17b8476cf7d6d8003c8ffd1db3be2bb69590d84ecaf3ab6e88bb0adbbc96 |
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) | fddbc1efee9014176368911331ab94f09fe939610866b3fc6ab00287baf2d7d0 |
| C̃ (Pseudo-output) | ca639e219a8ea6ef1587f8f26b2b57e27691a40bd2511f1f6ce50b8c9e35e7b2 |
| Pseudo-out (Balance) | a3c4e84e1d0daab06aec9424727436040a5b90cbc9d1b41d1ee22bd1eaf78193 |
Nullifier: The key image
KI = x · Hp(O) is a deterministic, unlinkable nullifier. It prevents double-spending without revealing which output is being spent.
Input 1 — Membership Proof
| Key Image (Nullifier) | 512bc8a744de46ede5198986f49ebd3b5f375ebf0cbe0c5e47dfaf2d5acf3cda |
| C̃ (Pseudo-output) | 0522b9e42e5ec2f079b44c46123d219c0586b4eb8a43d9e859793e701dbf3772 |
| Pseudo-out (Balance) | 8a8f796adda2deaff6690d53cb646677b7c9da5118e8357ea64e6acb3c5394cc |
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)