The cost of the same task can change completely depending on where you do it. Carry a bucket of water across a room — nothing.
Carry it up ten floors — a different job entirely. Same water. Same bucket. The environment decides the price.
Zero-knowledge systems have exactly this problem, and it's where most people stop paying attention.
In a private transaction on @Dusk , what has to be proven gets expressed as a circuit. And inside that circuit, ordinary operations get expensive fast. Hashing is the sharpest example. A standard hash like SHA-256 is trivial on your phone — but ruinously expensive inside a ZK circuit. Zcash learned this the hard way: using SHA-256 in-circuit caused a huge computational penalty.
That's why Dusk uses Poseidon — a hash function designed specifically to run efficiently inside zero-knowledge circuits. It's one of Dusk's core cryptographic primitives, alongside BLS12-381, JubJub and Schnorr.
The number that matters: Poseidon uses up to ~8x fewer constraints per message bit than Pedersen Hash. Fewer constraints means smaller, faster, cheaper proofs — the difference between privacy that's practical and privacy that's too slow to ship.
In Dusk it operates over the BLS12-381 field, handling commitments and Merkle-tree hashing. It's used in the stake contract, the transfer contract, and Citadel — providing the collision-resistant hashing used throughout Dusk's data structures.
And it isn't a primitive borrowed off the shelf: one of Poseidon's co-authors is affiliated with Dusk Network itself.
Honest take — an efficient hash doesn't make a system private or correct by itself. It's one piece in a stack (PLONK proving, JubJub, Merkle trees). But it's the piece that decides whether privacy is cheap enough to actually run at scale.
The expensive part isn't hiding data. It's proving it — affordably.
Follow the signal, not the noise.
$DUSK #dusk @Dusk
Carry it up ten floors — a different job entirely. Same water. Same bucket. The environment decides the price.
Zero-knowledge systems have exactly this problem, and it's where most people stop paying attention.
In a private transaction on @Dusk , what has to be proven gets expressed as a circuit. And inside that circuit, ordinary operations get expensive fast. Hashing is the sharpest example. A standard hash like SHA-256 is trivial on your phone — but ruinously expensive inside a ZK circuit. Zcash learned this the hard way: using SHA-256 in-circuit caused a huge computational penalty.
That's why Dusk uses Poseidon — a hash function designed specifically to run efficiently inside zero-knowledge circuits. It's one of Dusk's core cryptographic primitives, alongside BLS12-381, JubJub and Schnorr.
The number that matters: Poseidon uses up to ~8x fewer constraints per message bit than Pedersen Hash. Fewer constraints means smaller, faster, cheaper proofs — the difference between privacy that's practical and privacy that's too slow to ship.
In Dusk it operates over the BLS12-381 field, handling commitments and Merkle-tree hashing. It's used in the stake contract, the transfer contract, and Citadel — providing the collision-resistant hashing used throughout Dusk's data structures.
And it isn't a primitive borrowed off the shelf: one of Poseidon's co-authors is affiliated with Dusk Network itself.
Honest take — an efficient hash doesn't make a system private or correct by itself. It's one piece in a stack (PLONK proving, JubJub, Merkle trees). But it's the piece that decides whether privacy is cheap enough to actually run at scale.
The expensive part isn't hiding data. It's proving it — affordably.
Follow the signal, not the noise.
$DUSK #dusk @Dusk
