catopt-graph-graph-calculus-driven-compo/AGENTS.md

CATOPT-GRAPH AGENTS

Overview

• This repository contains a minimal, working MVP of CatOpt-Graph: a graph-calculus-inspired orchestration layer for compositional optimization across edge devices.
• The MVP focuses on a simple asynchronous-like ADMM-lite solver, contract primitives (Objects, Morphisms, Functors), and two starter adapters (rover and habitat) that map to canonical representations.

Architecture (high-level)

• core: Objects, Morphisms, Functors, and a tiny contract registry skeleton.
• admm_lite: a lightweight, fault-tolerant, delta-sync solver for two agents solving a simple distributed objective with a shared constraint.
• adapters/: two starter adapters (rover and habitat) provide readState/exposeLocalProblemData/applyCommand interfaces.
• transport: placeholder TLS/REST-like transport surface (mocked in MVP).
• governance: lightweight auditing placeholder.
• tests: unit tests for the ADMM-lite core.

How to run tests

• Ensure Python 3.10+ is installed.
• Run: bash test.sh

Development workflow

• Use the provided DAG of modules to extend adapters and add new ones.
• All changes should be backed by tests.

Note

• This is a minimal, opinionated MVP to bootstrap cross-domain interoperability. It is not a full production system.