Thread

Would be thankful for nostr:nprofile1qqst3axzay8sm4n8zg2n84acmt7hwwztpdg9r7p89e2f83v007f7zjcpr9mhxue69uhhqun9d45h2mfwwpexjmtpdshxuet59uq3wamnwvaz7tmjv4kxz7fwwpexjmtpdshxuet59uq32amnwvaz7tmjv4kxz7fwv3sk6atn9e5k7tc3s2hgn & nostr:nprofile1qqsxwkuyle67y94tj378gw8w2xw2wa6nwmwlqhddlwnz0z7sztsaw2qpz9mhxue69uhkummnw3ezuamfdejj7nxasma to poke holes in this approach...

Genius!!

Which WoT package are you using? Is it from nostr:npub1g53mukxnjkcmr94fhryzkqutdz2ukq4ks0gvy5af25rgmwsl4ngq43drvk

Can be whichever you want, could also be just a follow list (then omit the score range proof)

Interesting concept

This is cool. nostr:nevent1qqs0csmyepfv06tpntzuhvt9jrkv3u43eua32d98vpcvqq8snjvvy4qpp4mhxue69uhkummn9ekx7mqzyzm7669svt0xkjsju50a22zurc0qa589z2xd4yatzx6p2z64a5e0cqcyqqqqqqgs84mx7

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: https://delvingbitcoin.org/t/anonymous-usage-tokens-from-curve-trees-or-autct/862 . I also think reputation is a false trail but, meh, that's just a vague opinion.

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 😆

nostr:npub18ams6ewn5aj2n3wt2qawzglx9mr4nzksxhvrdc4gzrecw7n5tvjqctp424

Yeah, I'm the original vibe coder for a decade now.