Danus: open-source framework for mathematical reasoning with fact-graph memory
Danus is a new open-source framework that orchestrates mathematical reasoning agents using a fact-graph memory system. A main agent (Claude Code) directs a swarm of autonomous codex workers to prove statements, with a cold-start verifier as the sole authority on correctness. Verified results accumulate in a content-addressed fact graph, and a strategy loop decomposes problems and steers the swarm.
Entities
Related
Loop.js framework released for loop engineering with skeptical verify agent
Loop.js is a new open-source framework for loop engineering, allowing developers to define a goal and run iterative rounds until a separate, read-only Verify agent confirms completion. It supports terminal, scheduled, and embedded use, with memory persistence across rounds.
AgentMaker: a new Python framework for building LLM agents and multi-agent systems
AgentMaker is a general-purpose Python framework for building LLM agents and multi-agent systems, featuring tools, memory, RAG, context engineering, guardrails, human-in-the-loop, and observability. It is released under MIT license on GitHub and PyPI.
Local-first coding agent for long autonomous runs
Grinta is a local-first coding agent designed for long autonomous runs. It uses LLMs to autonomously plan and execute coding tasks, solving the problem of needing constant human supervision for extended development sessions.
Runeward: Sandbox AI agents with policy gates
Runeward is a sandboxing tool for AI agents that enforces policy gates to restrict agent actions. It uses LLMs to interpret and enforce user-defined policies, solving the problem of unsafe or unintended agent behavior for developers building autonomous AI systems.
Developer open-sources Istar Code v5.0.0 deterministic coding agent kernel
A developer released Istar Code v5.0.0, an open-source deterministic coding agent kernel that enforces consistent behavior across models from 1B to 500B parameters. The kernel uses an explicit INSPECT→PLAN→EXECUTE→VERIFY→REFLECT loop with instruction hierarchy, six task classes, and decision table routing to make AI-assisted development more predictable.