@polymutex.eth

I'd counter that zkTLS-proved social connections don't have to be proven by either end of any given social graph edge; any account (or one-off scraper script) could prove the existence of an edge, even between accounts for which onchain entries don't exist yet. This way, it could be feasible to recreate a graph with phantom nodes but non-phantom edges. Then the Keybase-esque flow would only be needed to claim a phantom node. I feel like that would meaningfully reduce the onboarding friction of individual users.

1 reply

0 recast

1 reaction