HSS-CoFHE

HSS-CoFHE proves transactions over data split across many servers, so no single server ever sees a plaintext. It reaches a 3,506× speedup over prior collaborative-FHE designs, fast enough to prove privately in real time.

core design

Core Design

Transaction data is split so no one server holds it, computation runs over the pieces, and the production path carries no encryption noise to slow it down.

collaborative proving

Collaborative Proving (VeriCoop)

VeriCoop is the protocol that proves over split data: no server ever holds your transaction, yet the proof it produces is public and anyone can check it.

• Each server gets only a random-looking fragment of the input
• Servers jointly compute the proof over their fragments
• Masking ensures the proof reveals nothing but its own validity
• The final proof is reassembled in public; no server ever held the whole

performance advantage

3,506× Performance Advantage

Removing the encryption noise removed the slowest work with it: a 3,506× speedup over prior designs, so private proving runs at the speed of live transactions.

threshold decryption

Threshold Decryption

No single server can open your data: it takes a configurable quorum, agreeing together, to decrypt anything, and breaking into fewer reveals nothing.

uc security

Composable by Design

The privacy layer is proven to stay secure not just alone but while running alongside the proving, consensus, and networking layers at once.