Reputation Proof
The zero-knowledge circuit of reputation proof in UniRep
Last updated
Was this helpful?
The zero-knowledge circuit of reputation proof in UniRep
Last updated
Was this helpful?
Users can use a reputation proof to claim that how the reputation is from a given attester. There are following things that user can choose to prove:
The pos_rep - neg_rep
given by the attester is more than the claimed min_rep
i.e.
The graffiti_preimage
of a graffiti
i.e.
The are computed correctly i.e.
The circuit also checks if the user has and performed in the claimed epoch.
epoch
epoch_key
GST_root
attester_id
rep_nullifiers_amount
min_rep
prove_graffiti
graffiti_pre_image
rep_nullifiers
epoch_key_nonce
identity_nullifier
identity_trapdoor
user_tree_root
GST_path_index
GST_path_elements
pos_rep
neg_rep
graffiti
sign_up
UST_path_elements
selectors
rep_nonce
Check the constrains in epoch key proof.
Check if hash(pos_rep, neg_rep, graffiti, sign_up)
is one of the leaves in the user state tree of root user_tree_root
.
Check if rep_nonce[i] < pos_rep - neg_rep
for all output rep_nullifiers[i]
.
Check if
min_rep
Check if
min_rep > 0
pos_rep - neg_rep >= 0
pos_rep - neg_rep >= min_rep
Check if hash(graffiti_pre_image) == graffiti
.
See:
See:
See the whole circuit in