After brainstorming with @Pip the WoT guy about anonymous relay access, I wrote up how zero-knowledge proofs could let users prove they're on a WoT trusted list, and that their score is good enough, without revealing which pubkey is theirs. View article →
Login to reply
Replies (19)
Would be thankful for @A₿del fgu & @npub1vadc...nuu7 to poke holes in this approach...
Genius!!
Which WoT package are you using? Is it from @Sirius
Can be whichever you want, could also be just a follow list (then omit the score range proof)
Interesting concept
This is cool.
View quoted note →
In Zsub we are using cryptographic chaining of attestations to avoid a central computation of trust or complex circuits.. So there is not central relay that knows the social graph or path and neither does anyone in the chain. Chain links just know each other verifier knows no one. Maybe doesn't matter for your case because the graph is already public, but it was nice that we could use simpler crypto (schnorr, pederson, merkle) and get more privacy. Not sure if that helps, but maybe interesting
So you're proving "I have a valid path to a trust root" without anyone ever assembling the full picture?
Access aside, trusted users list sound like a Chinese social rating system, no?
Exactly. No identities revealed. Not to the anchor, not to the verifier, and the relationship keys for the trust attestation are one-off delegations, so participants can't even collude. (Easily. There is always out of band correlation risk.)
Ahh sorry I thought you coded it. Would love to see a collab between Martti’s WoT package and Cairo.
I think algebraic merkle trees (curve trees) are a natural fit because you get fast verification (10-50ms without batching) and fast proof (relatively fast; a second or two), because of not having to put a cryptographic hash function through arithmetization. And you still get the same ability to embed logical conditions on what is in the leaves of the tree, using standard ZK proving systems like bulletproofs (e.g. I did "proof of reserves" in aut-ct). Maybe worth looking at Luke Parker's work on FCMP for how much this can scale. I described aut-ct more wordily here if it's interesting:
.
I also think reputation is a false trail but, meh, that's just a vague opinion.
Delving Bitcoin
Anonymous usage tokens from curve trees or autct
Ever since whenever (I think when we introduced fidelity bonds in Joinmarket), I’ve been researching the best way to have private proof of pubkey...
I leave the coding to the actual wizards, I just code in English...
It ain't bad if you can opt out.
nerd sniping is coding at the highest level.
meta-coding 😆
Yeah, I'm the original vibe coder for a decade now.
That’s super cool!
My only caveat is to use STARKs and not SNARKs.
Also for quantum resistance