Go from natural language to verified finite state machines — topology bugs caught before code runs.
Orchestrated State Machine Language — a two-layer architecture for reliable LLM code generation. The core insight: LLMs generate flat transition tables reliably, but they struggle to guarantee topology correctness on their own. Orca separates program structure (state machine topology) from computation (action functions), then verifies the structure automatically before any code runs. Machines are…
Inferred from the transports this listing declares (stdio). A client not listed here hasn’t been ruled out — it just isn’t something Forge can confirm.
Verification confirms publisher identity (repo ownership), not code safety. The security scan covers known CVEs and suspicious install scripts.
Forge read 2 source files from the published package tarball and matched no MCP tool registrations. Extraction is pattern-based over shipped source: a server that builds its tool list at runtime, or that ships only bundled or minified code, registers nothing this can see. Treat it as “not detected”, not as “exposes none”.
Orchestrated State Machine Language — a two-layer architecture for reliable LLM code generation. The core insight: LLMs generate flat transition tables reliably, but they struggle to guarantee topology correctness on their own. Orca separates program structure (state machine topology) from computation (action functions), then verifies the structure automatically before any code runs. Machines are written in plain Markdown — a format LLMs can read and write natively. ctx.retrycount Context(ctx)…
This package was last scanned before Forge began storing the resolved tree. The next scan will record it.