BIS: XRPL prototype unlikely to burn significant XRP

The Bank for International Settlements published Working Paper 1374 on Sept. 2 describing an experimental prototype that anchors cryptographic fingerprints of official statistical files on the XRP Ledger. The paper models technical performance and economic effects and reports that batching anchors reduces the number of on-chain transactions required.

The prototype accepts statistical data in the SDMX format, normalizes the file, and applies SHA3-512 hashing either to whole files or to individual data series. Those hashes are combined into a Merkle tree; the Merkle root is recorded in the memo field of an XRPL transaction. The source statistics and the system’s proof records remain off-chain. A returned SDMX file contains the transaction reference, ordered fingerprints and a signed verifiable credential so a recipient can rebuild the Merkle root and compare it with the public ledger entry.

The authors describe the implementation as an open-source DevNet proof of concept that is unsuitable for production and unmaintained. They chose XRPL for its low nominal fees, fast consensus finality and developer tools, but the paper notes the blockchain interface is replaceable and another ledger could serve the same anchoring function. The authors state they have no commercial relationship with Ripple.

Performance measurements came from controlled tests on XRPL DevNet run from a single developer workstation against a synthetic SDMX corpus. In those tests median publication latency was three to five seconds and verification took one to two seconds. The tests used test XRP on DevNet and did not include Mainnet conditions such as sustained network load, enterprise firewalls, hardware-security-module signing or adversarial behavior.

The paper models XRPL’s fee mechanics under current rules. XRPL’s standard minimum fee is 10 drops, equal to 0.00001 XRP, and that fee is destroyed when a transaction is validated; network load or special transaction types can raise the cost. By batching many datasets into a single transaction via a Merkle tree, publishers can compress the number of on-chain commitments. As an illustrative example, anchoring one million datasets with 1,000 datasets per anchor would require 1,000 transactions and burn about 0.01 XRP at the base fee, while anchoring each dataset individually would require one million transactions and burn about 10 XRP.

The paper includes additional illustrative calculations: continuous anchoring at one per minute over a year would burn roughly 5.256 XRP at the base fee, and anchoring once per second would burn about 315.36 XRP in that model. Using an illustrative XRP price input of $0.30, the authors’ cost model produces an on-chain fee cost of about $0.000000003 per dataset when batching 1,000 items. The paper notes that above roughly 50 items per batch, off-chain processing and raw storage begin to dominate costs compared with the on-chain fee component. Urgent releases that use smaller batches would raise per-dataset on-chain fees proportionally.

Mainnet reserve rules create a potential second channel for XRP demand. Current XRPL rules require a 1 XRP base reserve per account and an additional 0.2 XRP for each reserve-counting ledger object. A dataset anchored via a memo from an existing account does not add a new 1 XRP base reserve each time. Production deployments that create many new accounts or ledger objects could increase the amount of XRP held as reserves; the scale of that effect depends on deployment architecture and any changes validators make to reserve levels.

The paper frames XRPL as a low-cost authentication layer for official statistics under the controlled conditions of the experiment and reports that Merkle batching compresses recurring fee flows. The authors state that direct fee-burning on Mainnet would remain small unless anchoring cadence, broad account creation or other sustained XRP-centered activity occurred at scale.