Private DeFi, explained

Zero-knowledge proofs, nullifiers, anonymity sets, linked addresses, THORChain and the other words around private DeFi, each in plain English, with how it shows up in Redacted.

Privacy and cryptography

Address reuse

Address reuse means receiving more than one payment to the same address. Every payment to it is then linked to all the others, and to everyone who sent them.

Anonymity set

An anonymity set is the group of people a given action could have come from. The larger it is, the harder it is to tell who did it.

Arithmetization

Arithmetization turns a computation into algebra: its steps go into a table, each column becomes a polynomial, and the rules become polynomial equations. STARKs use this form and call it an AIR.

Bitcoin privacy

Bitcoin is pseudonymous. Addresses carry no names, but every transaction is public and permanent, so once one of your addresses is tied to you, anyone can read its history and the addresses linked to it.

Bunker mode

Bunker mode is Justin Drake’s name for a calm, early move of crypto to addresses whose public keys stay hidden behind a hash, in case elliptic curves break. In Redacted, one click puts your account on 25 words, with no wallet key behind it.

Chain analysis

Chain analysis traces funds on public blockchains and groups addresses into likely owners, using the public record together with outside data such as exchange records, address labels and leaks.

Commitment

A commitment locks in a piece of data without revealing it. Later it can be opened and anyone can check that it matches, but until then it gives nothing away and cannot be changed.

Confirmation

A transaction gets one confirmation when a block includes it, and each later block adds one more. THORChain waits for more confirmations on larger transfers, up to a maximum set for each chain.

ECDSA

ECDSA is the elliptic-curve signature scheme behind most Bitcoin and Ethereum wallets. It proves that the holder of a private key approved a message without revealing the key, and its security rests on the secp256k1 curve.

Elliptic curve cryptography

Elliptic curve cryptography builds key pairs from points on an elliptic curve over a finite field. It gives about the strength of 3072-bit RSA with 256-bit keys, and Bitcoin signs with the secp256k1 curve.

Exposed public key

A public key is exposed once it is visible on the chain, which usually happens the first time its address spends. Until then most addresses show only a hash of the key, which gives a key-breaking attacker nothing to start from.

Extended public key

An extended public key, or xpub, lets anyone derive every receiving address of a wallet account without being able to spend. Whoever holds it can see all of those addresses and their full history.

Fiat-Shamir transform

The Fiat-Shamir transform turns an interactive proof, where the verifier sends random challenges, into a single message. The prover computes each challenge as a hash of everything sent so far, so no back-and-forth is needed.

Finite field

A finite field is a set with a fixed number of elements, where addition, subtraction, multiplication and division by a nonzero element always stay inside the set. STARKs do their arithmetic in one.

FIPS 205

FIPS 205 is the NIST standard for SLH-DSA, a digital signature scheme built on hash functions alone, published in August 2024. It sits beside FIPS 203 and FIPS 204 as one of NIST’s first three post-quantum standards.

FRI

FRI is the low-degree test used in STARKs. It checks that committed values come from a polynomial of low degree by halving the problem round after round and testing a few random points, and it rests only on hash functions.

Front-running

Front-running is trading ahead of an order you can see coming. On public chains, bots and traders watch visible orders and wallets and act first, at the expense of the person whose order they saw.

Grover’s algorithm

Grover’s algorithm is a quantum search method that finds one item among N in about the square root of N steps. Against symmetric keys and hashes, it halves the strength in bits, so a 256-bit key keeps about 128 bits of strength against it.

Harvest now, decrypt later

Harvest now, decrypt later means recording encrypted data today to decrypt it once quantum computers are strong enough. Anything encrypted on a public blockchain is stored for good, so it is open to this by design.

Hash function

A hash function turns any input into a short fingerprint of fixed size. The same input always gives the same fingerprint, and nobody can work back from it or find two inputs that share one.

Hash-based signature

A hash-based signature proves that the holder of a private key approved a message, and its security rests only on a hash function. Leslie Lamport described the basic idea in 1979, and SLH-DSA, published as FIPS 205 in 2024, is a modern version.

Linked addresses

Linked addresses are addresses that chain analysis attributes to the same owner, most often because they were spent together in one Bitcoin transaction. Once one of them is tied to a name, all of them are.

Mempool

The mempool is the waiting area for valid transactions that no block has included. Each node keeps its own copy, so anyone running a node can see the transactions in it before they are confirmed.

Merkle proof

A Merkle proof shows that an item belongs to a Merkle tree. It is the item together with a short list of sibling hashes, which lets anyone recompute the tree's root and compare it with the root they already trust.

Merkle tree

A Merkle tree fingerprints a long list with one short value, the root, so that anyone can prove an item is in the list with a handful of hashes instead of the whole list.

ML-DSA

ML-DSA is the lattice-based digital signature standard that NIST published in August 2024 as FIPS 204. It was derived from CRYSTALS-Dilithium, and its signatures are much shorter than those of the hash-based standard SLH-DSA.

ML-KEM

ML-KEM is the key-encapsulation standard that NIST published in August 2024 as FIPS 203. It was derived from CRYSTALS-Kyber, and its security rests on the Module Learning With Errors problem, a lattice problem that is believed to resist quantum attacks.

Nullifier

A nullifier is a unique value published when a private note is spent. It lets the chain reject a second spend of the same note without revealing which note was spent.

Polynomial commitment

A polynomial commitment is a short value that binds a prover to one polynomial. Later the prover can prove the polynomial's value at any chosen point, and the verifier checks that proof against the short value.

Post-quantum cryptography

Post-quantum cryptography is ordinary cryptography designed to stay secure when large quantum computers exist. It replaces the key exchanges and signatures that Shor’s algorithm breaks, such as RSA and elliptic curves, with schemes built on lattices, hash functions or error-correcting codes.

Private DeFi

Private DeFi is decentralized finance, such as trading, swapping, lending and borrowing, used from accounts with no visible link to your wallet. The rules stay on-chain for anyone to check, while your positions stop adding up to one public profile.

Prover and verifier

In a proof system, the prover makes a claim and builds a proof, and the verifier checks that proof. The verifier accepts only a valid proof, so the prover's claim does not have to be trusted.

Public-key cryptography

Public-key cryptography gives each person a private key that stays secret and a public key that anyone can see. A signature made with the private key can be checked with the public key, so no secret has to be shared in advance.

Quantum computer

A quantum computer works with qubits, which can hold a combination of 0 and 1 and can be entangled with each other. A cryptographically relevant one would be large and reliable enough to break the public-key cryptography that wallets and websites rely on.

Self-custody

Self-custody means you hold the keys to your funds yourself, so no company can freeze, lose or move them on your behalf.

Shielded pool

A shielded pool holds funds as private notes inside a smart contract. Deposits and withdrawals are public, but what happens inside is proved with zero-knowledge proofs and does not reveal who owns what.

Shor’s algorithm

Shor’s algorithm is a quantum method, described by Peter Shor in 1994, that factors large numbers and computes discrete logarithms in polynomial time. A large enough quantum computer running it would break RSA and elliptic-curve signatures such as ECDSA.

SLH-DSA

SLH-DSA is the hash-based signature standard NIST published as FIPS 205 on 13 August 2024. It is based on SPHINCS+, its security rests on hash functions alone, and the signer keeps no state between signatures.

Soundness and completeness

Completeness means an honest prover can always convince the verifier of a true statement. Soundness means a cheater cannot convince the verifier of a false one, except with a negligible chance.

STARK

A STARK is a short proof that a long computation was done correctly, which anyone can check quickly. It is built from hash functions alone, so it needs no trusted setup and no elliptic curves, and it can keep the inputs secret.

Stealth address

A stealth address is a one-time address created for a single payment, so payments to the same person cannot be linked on-chain, while the sender only needs the receiver’s public address.

Succinct proof

A succinct proof is far shorter than the computation it covers, and far quicker to check than to redo. Its size and checking time grow only slowly as the computation grows, so a blockchain can verify a long computation cheaply.

Trusted setup ceremony

A trusted setup ceremony creates the public parameters that some zero-knowledge proof systems need. Each participant adds secret randomness and destroys it, and the result is safe as long as at least one participant was honest.

UTXO

Bitcoin keeps no account balances. It keeps unspent transaction outputs, or UTXOs, which are the coins a wallet can spend, and each payment spends whole UTXOs and creates new ones.

Viewing key

A viewing key lets someone see the history of a private account without being able to spend from it, for example to show an accountant or an auditor exactly what happened.

Wallet tracing

Yes. On public chains such as Bitcoin and Ethereum every transaction is stored for good, so anyone can follow where a wallet’s money came from and where it went. A wallet stays pseudonymous only until one address is tied to a name.

Zero-knowledge proof

A zero-knowledge proof lets someone prove that a statement is true without revealing anything else, for example that they own funds and may spend them, without showing which funds or who they are.

zk-SNARK

A zk-SNARK is a zero-knowledge proof that is small, quick to verify and needs only one message from the prover, which is why blockchains can check them inside a smart contract.

Redacted

Emergency exit

The emergency exit opens by itself if no active Redacted node carries an action or sends a heartbeat for 7 days. Anyone can then withdraw from the Reserve, or close positions and move funds out of Spending, by submitting the action from their own wallet.

Node network

Redacted’s node network is a group of independent, bonded operators who carry private actions on-chain and approve every deposit, each choosing what it checks before it approves. No single node can send a deposit back or pause deposits alone.

Note

A note is a sealed entry on-chain that records coins in Redacted’s Reserve and that only your keys can open. From the outside all notes look alike, whoever owns them and whatever they hold.

Ozone

Ozone is the reference screener built by Redacted’s core contributors. It answers whether an address is tied to known hacks or sanctions lists, works only from public data and decides nothing itself.

Private Mode

Private Mode is the private side of Redacted. You open it with one wallet signature that creates your private keys in your browser, or with 25 words in bunker mode, and after that zero-knowledge proofs authorize every action, so your wallet has nothing more to sign.

Relayer

A relayer submits a transaction to the blockchain on someone else’s behalf and pays its network fee. Privacy tools use relayers so that a private action doesn’t have to come from, or be paid for by, the user’s own wallet.

The Reserve

The Reserve is the shared space where every Redacted user’s deposits live together as sealed notes. From the outside all notes look alike, so an action from the Reserve could have come from anyone who has the same coin in it.

Spending account

A Spending account is your personal private account in Redacted. It is a smart-contract account with no visible tie to your public wallet, and from it you trade, swap, stake, lend and borrow on Rujira.

The wait

In Redacted, new money waits about two hours before it can be used privately. That gap keeps a deposit from being matched to what you do with it minutes later, so your crowd stays at its full size.

THORChain

Affiliate fee

An affiliate fee is a share of a swap that goes to the interface which routed it. The swap memo sets the share in basis points, and the protocol pays the fee out to the affiliate.

Inbound address

An inbound address is the address on a connected chain where you send coins to THORChain, and it belongs to the active vault that THORChain’s nodes control together. It changes when the vaults change, so read the current one right before you send.

Liquidity pool

A THORChain liquidity pool sets the price of a swap from the balances in the pool. The bigger the trade compared with the pool, the larger the slip, and that slip is the fee paid to liquidity providers.

Maya Protocol

Maya Protocol is an ecosystem of chains, and its live chain, MAYAChain, is a friendly fork of THORChain that swaps coins from several chains. Its native coin is CACAO, which pays network fees and settles swaps between other coins.

Memo

A memo is a line of text attached to a THORChain transaction that tells the network what to do with the coins, such as which coin you want back and who receives it. Anyone can read it, because it sits in the public transaction.

Native cross-chain swap

A native cross-chain swap trades a coin on one chain for a coin on another, for example Bitcoin for Ether, by moving the real coins between vaults instead of minting wrapped copies on a bridge.

Outbound fee

The outbound fee is what THORChain charges to pay the gas for the last step of a swap, the transaction that delivers the coin on its destination chain. It is taken from the swap output, so the amount you receive is after the fee.

Price limit

A price limit is the least amount of a coin you accept back from a swap, written into the memo. If the swap would pay less than that, THORChain refunds your coins instead of filling the swap below the limit.

Price oracle

A price oracle brings market prices onto a blockchain so that smart contracts can use them, for example to value collateral and decide when a loan gets liquidated.

RUNE

RUNE is THORChain’s native asset. Node operators bond it to take part in the network, and it sits on one side of every pool of liquidity, so a swap from Bitcoin to Ether runs from BTC to RUNE to ETH in one flow.

Secured assets

Secured assets are native coins deposited into THORChain’s vaults and held one to one on THORChain, such as BTC-BTC for Bitcoin. Apps use them for trading, lending and more, and they can be withdrawn back to their home chain as the real coin.

Streaming swap

A streaming swap cuts one large swap into smaller sub-swaps that run over several blocks, so each piece moves the price less. You choose the interval between pieces and how many pieces there are.

THORChain

THORChain is a network that swaps native coins across chains, such as Bitcoin for Ether, with no bridges and no wrapped tokens. The coins sit in vaults on their home chains, secured by about 100 independent node operators.

THORChain privacy

No. THORChain is a public network, and every swap shows its amounts and the addresses on both sides. A cross-chain swap even links your address on one chain to your address on the other, because the receiving address is written into the swap’s memo.

THORName

A THORName is a human-readable name on THORChain that points to addresses on several chains. Affiliates use one to collect fees, and it stays registered until the blocks it was paid for run out.

Vault

A THORChain vault is an address on a connected chain that holds real coins, such as Bitcoin or Ether, and that THORChain’s nodes control together. Its key is split among the nodes, so no single node can move the coins alone.

Wrapped token

A wrapped token stands in for a coin from another chain, such as WBTC for Bitcoin on Ethereum. It is worth the real coin only as long as whoever holds the original keeps it safe and honors redemptions.

Rujira

Updated November 1, 2026. The full details live in the documentation.