Pinned
I built a Transformer variant whose circuits can be formally verified.
For small circuits, an SMT solver can prove:
- Robustness to bounded noise
- Equivalence to symbolic programs
- Each edge in the circuit is necessary
Not interpretability. Not evals. Proofs.
Repo below:
