Aura-State: Formally Verified LLM State Machine Compiler

13 points | by rohanmunshi08 3 days ago

3 comments

  • Perenti 8 minutes ago
    Interesting. Seems you are automating my qwen workflow. Every output stage is verified through mathematical proof whenever possible, before being fed to the next step in transforming ideas into code. Except for when qwen decides to go in a very unusual direction, its working reasonably well at producing provably correct code. It's slowish though, with lots of nested iterations, and when qwen goes strange it takes a lot of effort to get it back on task.
  • ozozozd 3 days ago
    This is interesting and I would appreciate if you could elaborate with a few examples, and perhaps mention what inspired this, and/or what’s similar and/or analogous to your method.
  • aristofun 3 days ago
    Couple of simplified examples for us, mere mortals, not mathematicians would be nice.