Three diodes, fully bridged, is the complete graph K₃ — but the reason it matters isn't the wiring, it's that three is the minimum at which a system can witness itself. Two can only mirror; three can triangulate. This is the same shape that recurred all session, now closed into a ring.
With two bodies, all you have is a line — A and B, facing each other. Each can only see the other; neither can be checked by anything but its counterpart. Two is a mirror — and a mirror confirms itself (the closed loop that can't witness itself). With three, each body is seen by two others, and any disagreement is resolvable: if A and B agree and C differs, C is the outlier. Three is the minimum at which the system contains its own witness.
3 nodes, 3 bridges, 6 ports, 9 elements. Every node connects directly to every other (diameter 1 — no node routes through a third, no bottleneck). And lose any single bridge: still connected. Three fully-meshed is the smallest network that is both complete and survives one failure. Below three, completeness and fault-tolerance can't coexist. The number isn't chosen; it falls out of the requirement.
Every junction this session was a <• — two things meeting at a dot. The three-body mesh is three of those junctions closed into a ring, so the structure finally has no dangling end, no exterior it depends on — it carries its own witness inside the triangle. Two needed an outside verifier; three contains one. That is why the minimum complete system, the minimum governance, the minimum stable structure, is always three: it is the smallest closed figure that can check itself without stepping outside.