GIVEAWAY #BRG

DeepSafe Verified account @DeepSafe_AI · Oct 6

Ring-VRF is the method CRVA uses to select different batches of committee members. The documentation is specific about what its proof reveals and what it does not, and the distinction is worth reading closely.

Ring-VRF separates the identification of a specific signer from the proof that the signer is eligible.

A member proves their public key belongs to a published set without revealing which one. The docs name this directly — "Anonymous Key Ownership Proof: Allows a member to prove their public key belongs to a specified set without revealing which one." The mechanism is a one-out-of-many protocol, whose stated job is to prove that some pkₗ is in {pk₀,...,pkₙ₋₁} without revealing ℓ.

Membership by itself would not be enough. The same step also produces a verifiable random value derived from the member's private key and a random seed. So the proof carries two claims at once: my key is in this set, and this random output came from that key.

What holds those two together is a separate piece. A consistency sub-proof links the Pedersen commitment and the PRF output to the same private key. The documentation is plain about what it is there to stop: "Forgeries using mismatched keys."

Without that link, both halves could hold on their own without establishing that they came from the same key — membership shown with one key, randomness produced from another.

That is the part worth taking from the design. The anonymity is not bought by asking for less. The verifier still checks membership, still checks that the random value derives from the seed, and still checks that both trace back to one private key. What it never learns is which member.

Docs:

docs.deepsafe.network/introduction/r…

#DeepSafe #CRVA #Web3Security

View quoted post on X