We present Harmonic Swarm, a federated peer-to-peer inference routing protocol in which nodes advertise their Vortex shell affinity rather than load metrics. When a request arrives, the node's VortexGate computes the prompt's shell classification and dispatches to the peer whose claimed shells match. We prove four routing properties: shell routing guarantee, availability under partition, monopolization resistance, and stateless routing. The protocol is the first distributed inference system where routing decisions are derived from symbolic alignment geometry rather than resource availability. Implemented in MaiiaM Alchemist v0.4.1 as the swarm.* JSON-RPC namespace. Defaults to safe single-node operation; multi-node activated by swarm.join(directoryUrl).
Weslyn Cory Whitehead (Mon,) studied this question.