Would be thankful for nostr:npub1hr6v96g0phtxwys4x0tm3khawuuykz6s28uzwtj5j0zc7lunu99snw2e29 & nostr:npub1vadcfln4ugt2h9ruwsuwu5vu5am4xaka7pw6m7axy79aqyhp6u5q9knuu7 to poke holes in this approach...
Discussion
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)
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.