Nobody who can access a single component or share of a key, or the medium carrying it, can also reach enough other components or shares of that key, or media holding them, to meet the threshold that forms the key; where an m-of-n arrangement uses a recognised secret-sharing algorithm, no single person may hold m shares.
The graph holds this control, the 0 it maps to, and the evidence behind each claim, over MCP and REST.