Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs

Develop a tool that compiles complex proof attempts into compressed state representations to reduce LLM token usage during verification. This would bridge the gap between heavy formal provers and efficient LLM-based reasoning.

Suggested repo: proof-zip

"Stop wasting tokens on every proof step; compress your theorem prover outputs."

Estimated effort: 80h