This has some interesting similarities to what we're doing in Zsub.
https;//zsubmesh.net/
We use recursive schnorr PoK over pederson commitments and a merkle. So we get verifiable attestation chains without revealing the chain. You get roles too. Without exotic ZPKs, though we may do bulletproofs later. (We still haven't decided. It is possible to support range proofs more simply.)
