Aura-State – A Formally Verified LLM State Machine Compiler
Formal verification for LLM workflows—CTL model checking, Z3 proofs, zero hallucination math.
Your TLA+ spec and your TypeScript code drift apart. This kit makes that impossible.
TLA+ model checking without learning TLA+ — build fails if spec and code diverge.
Backend developers building complex stateful systems
TLA+ · Alloy · P language
Formal verification for LLM workflows—CTL model checking, Z3 proofs, zero hallucination math.
Fixed-point rule evaluation as a procedural macro; compiles to zero-overhead Rust, not a VM.
Type-state machine forces valid regex at compile time—IDE won't suggest invalid steps.
Compile-time generated scheduler beats manual match-loop-state hell for complex state machines.
TypeScript compiler using Google Closure Compiler for type-driven size optimizations.
Finally, a Python DSL that outputs real Excel formulas instead of baked values.