Type any equation. See its SuperBEST circuit.
The expression parses into a SuperBEST tree: each internal node is an F16 operator, each leaf is a variable or constant. Colour = operator family. Hover any node to see its intermediate value at the sample input below. Wires flow bottom-up: leaves at the bottom, root (final output) at the top.
nodes
7
4 ops · 3 leaves
SuperBEST
6n
v5.2 positive domain
naïve
28n
pre-optimisation
savings
78.57%
22n saved
add / sub / mul / div / neg
exp / log / ln / pow / recip
sqrt (EPL)
sin / cos / tan
abs (piecewise)
free variable
numeric constant
Parser is the same ~200-line recursive descent as the live optimiser — supports
+ − * /, ** /^, parentheses, and the standard unary functions exp, ln, log, sqrt, sin, cos, tan, abs. Costs are the v5.2 positive-domain table (mul = 2n placeholder, exp = 1n, sqrt = 1n via EPL(0.5, x), etc.). Each variable binds to the sample input x above; numeric results are informational and may overflow or produce NaN for extreme inputs.