Module boundary 

Comfort-zone boundary via global minimum cut on the trust-weighted context graph.

Patent Claims 9–12: automatic discovery of the comfort-zone boundary as a computed structural property of the trust manifold, not a threshold parameter.

Two-graph architecture

Graph A — World Shape (cosine similarity only, stable) Edge weight = cosine_similarity(vocab_A, vocab_B) ∈ [0.0, 1.0]

Graph B — Trust Shape (patent-faithful, dynamic) Activates once both endpoints have ≥ MIN_TRUST_OBSERVATIONS interactions. Edge weight = sim × tanh(coh_A × TRUST_SCALE) × tanh(coh_B × TRUST_SCALE)

Algorithm

Stoer-Wagner global minimum cut, O(V·E + V²·log V). Exact for any graph ≤ MAX_CONTEXTS (64) nodes.

Invariants

• I-BNDRY-001 — Min-cut on context-key graph, not episode graph
• I-BNDRY-002 — Edge weight ∈ [0.0, 1.0]
• I-BNDRY-003 — Edges inserted only when cosine similarity > EDGE_THRESHOLD (0.1)
• I-TRUST-001 — Trust component activates only after MIN_TRUST_OBSERVATIONS (50)
• I-DIST-001 — no_std compatible; uses hashbrown HashMap
• I-DIST-005 — Zero unsafe code

Structs

MinCutBoundary

Comfort-zone boundary via global minimum cut on the trust-weighted context graph.

MinCutResult

Result of a minimum cut computation.

Constants

MAX_CONTEXTS

Maximum number of contexts tracked in the boundary graph.

MIN_TRUST_OBSERVATIONS

Minimum positive interactions before the trust component activates (I-TRUST-001).