From what I can understand from the wikipedia page for the graph theory trees https://en.wikipedia.org/wiki/Tree_(graph_theory) https://en.wikipedia.org/wiki/Tr

From what I can understand from the wikipedia page for the graph theory trees https://en.wikipedia.org/wiki/Tree_(graph_theory) https://en.wikipedia.org/wiki/Tree_(graph_theory), what I'm used to calling tree ("computer science trees"?) are rooted trees, and what you described could be called a tree. Which kind of makes sense, because a tree has stuff that branches out at the top (the branches) and at the bottom (the roots). The trunk has multiple parents and multiple children. Definitions aside, I like your idea a lot. I feel like it's one of the few propositions that recognizes how important proving your identity already is, and how it will only become more important. The system is flexible and makes sense. It's the kind of thing that I think most people could understand, and thus use.