TORQUE is a trustless bridge — no multisig, no committee, no admin key. Its security comes from light clients and a zero-knowledge proof that took six audits and a bespoke proving circuit to build.
Before it can hold a single token, its proving keys must be created by a public ritual: many people, each stirring in secret randomness and then deleting it. The keys are honest if any one participant anywhere in the chain deleted their secret — the ritual's math, not our word. Your randomness multiplies into the foundation permanently, and your hash goes on the wall below, forever.
One command. No installs, no accounts, no identity. Honest minimums:
curl -fsSL https://ceremony.torque-bridge.xyz/contribute.sh | bash
Then post your hash on X, tagging @torquebridge — that post is your claim to the contributor allocation and your permanent place on the wall.
The coordinator server sees connecting IPs like any website does — nothing is published or logged by us. The contribution itself (a file of elliptic-curve points) and your hash contain zero identifying data. The paranoid route: prefix the command with HTTPS_PROXY=socks5://… — Tor or any VPN works out of the box.
They'd need every secret from every TORQUE contributor and all 54 participants of the 2019–2023 public ceremony our foundation derives from, across five years, before TORQUE existed. One honest deletion anywhere makes the final key unknowable — to us included.
An open-source Go tool. It downloads the current ceremony state, samples a random secret, applies it (with a zero-knowledge proof that it did so correctly), uploads the result, prints your hash — and deletes the secret. Source: torque-ceremony on Radicle (no GitHub — we practice the decentralization we preach), seeded by the coordinator alongside the final transcript. Clone it: rad clone rad:z31aPZtkhabUNZqeWKeVaCtZqyKAV
The wall updates live above. When the window closes, a public randomness beacon (drand) seals the final keys, the full transcript is published, and anyone can re-run the verification and reproduce them, bit for bit.
