IACT: A Self-Organizing Recursive Model for General AI Agents: A Technical White Paper on the Architecture Behind kragent.ai
Pengju Lu
TL;DR
IACT presents a self-organizing recursive topology for general AI agents that replaces static workflows with dynamic, bidirectional dialogues to manage open-ended tasks. It details a macro- and micro-architecture, including dynamic context construction, a perception–action loop, and a unified Extended Markdown protocol, all geared toward mitigating error propagation and context degradation. The paper reports qualitative evidence from production deployments (kragent.ai), case studies, and security-focused system design, arguing that dynamic topology and runtime tool synthesis enable reliable, scalable autonomous workflows today. Collectively, IACT argues for a shift from pre-defined scripts to adaptive, agentic computing that grows its structure as tasks demand, with practical implications for engineering, research automation, and AI alignment.
Abstract
This technical white paper introduces the Interactive Agents Call Tree (IACT), a computational model designed to address the limitations of static, hard-coded agent workflows. Unlike traditional systems that require pre-defined graphs or specialized programming, IACT operates as a general-purpose autonomous system driven purely by user dialogue. Given a high-level objective, the system autonomously grows a dynamic, recursive agent topology incrementally tailored to the problem's structure. This allows it to scale its organizational complexity to match open-ended tasks. To mitigate the error propagation inherent in unidirectional function calls, IACT introduces interactional redundancy by replacing rigid invocations with bidirectional, stateful dialogues. This mechanism enables runtime error correction and ambiguity resolution. We describe the architecture, design principles, and practical lessons behind the production deployment of this model in the kragent.ai system, presenting qualitative evidence from real-world workflows rather than exhaustive benchmark results.
