Transaction Details
| TX Hash | eed7b8739bbec3cecaeb599c6373dc90ffe25467b8ff0b96ddc1b421ae66e41f |
| Block | 11,427 |
| Timestamp | Sun, 15 Mar 2026 04:30:29 GMT (1d ago) |
| Confirmations | 14 |
| Fee | 0.01 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 | 787553878e1cc618984c86bfffcbc666237689bfde92ee545fab0a7c60e51349 |
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) | 64ee2dc74b92dbaf688e11f69ca92177b7627acf80f0473ae8374a1361a25bee |
| C̃ (Pseudo-output) | 53cdc7813cbab116ee67008531c3b295d62e4e81e4514968fc07f44347deccc1 |
| Pseudo-out (Balance) | b8d199f05a3b2bfb2fa27505712331290e0dc4270d0b81e0a0163f48d0c55629 |
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) | 40c6f95b6727decf0a1872f5d022da36bf9c7f948b471c453e7fb8906b37e306 |
| C̃ (Pseudo-output) | b0bece098ff0abd1f5a54c81af9d63f265367811786692e2ca44db53f0b97078 |
| Pseudo-out (Balance) | c2375b58bfe24995152563d7d787bd1380dcc9647e990ce97adf970c897ac7e9 |
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)