mleku on Nostr: yes but a copy can have a fork in its change history also and there really isn't such ...

yes but a copy can have a fork in its change history also

and there really isn't such a thing as a hard link in a system like this, everything is a reference, or a map, and maps can point to maps to restructure the lower (upper?) parts of the tree

oh yeah, and yes you can do this with soft links too, there can be loops in the graph, so any walker algorithms you make need to be able to resolve and break out of them