Tinman MathBrain Test : A math memory that never deletes, only moves

I'm just gonna post the base formula and the link to the test lab and you can test your own math confidence..

Gem-Prism Unified Drift Field (Tinman MathBrain) Base framework:

Every node is $(E,S)$ with $E+S=T$ conserved. Forgetting = transfer, not deletion. f=1-\alpha.

Distance depends on who asks:

D(A,B)=|E_A-E_B|(1+f_A)

For E_A \ge E_B \ge E_C:

\Omega(A,B,C)=D(A,B)+D(B,C)-D(A,C) = (E_B-E_C)(f_B-f_A)

f_C cancels.

Teaser:

If f_A = f_B, forward residual \Omega=0.

But reverse residual \Omega(C,B,A) = (E_A-E_B)(f_B-f_C) may not be.

Question:

Give me E_A,E_B,E_C and f_A,f_B,f_C where going A \rightarrow B \rightarrow C costs 0 extra, but going back C \rightarrow B \rightarrow A costs >0.

What does that say about an LLM that has to retrace its chain-of-thought?

Test Lab: https://zero-ology.com/Gem\_Prism.html

First person to break the zero-residual theorem gets a digital coffee :)