🧮 Theorem Nodes

8 theorem nodes in the spellweb knowledge graph.

Nodes

• C10: Three-Axis Multiplicativity — Conjecture: Is three-axis separation truly multiplicative or does interaction co
• C6: P^1.5 Correspondence — Conjecture: Is P^1.5 ↔ 96/64 structural or coincidental? If structural, entire e
• C7: Compression Modifier — Conjecture: Does BRAID 74× compression reduce attack surface multiplicatively? C
• C8: Guild Scalability — Conjecture: O(1) shared-parent coordination scales without quadratic overhead. G
• Error Floor Theorem — P_e ≥ 1 - R_max via Fano's inequality, under non-collusion and the stated advers
• Graceful Degradation — Small ε violations → bounded privacy losses. System fails gracefully.
• Reconstruction Ceiling — R_max = (C_S + C_M) / H(X). While the capacity-deficit condition C_S + C_M < H(X
• Separation Theorem — I(X; Y_S, Y_M) = I(X; Y_S) + I(X; Y_M). Information leakage is additive, not mul

← Welcome Visitors