Blog
Repo readiness, execution governance, and AI agent notes.
Browse product notes, engineering notes, field notes, and release essays about contract-first onboarding, CI alignment, and agent-safe repository operations.
Why Heavier Repository Execution Needs Audited Boundary Crossings
Why publishing, migrations, deployments, and other non-routine repository tasks need explicit crossing evidence, and how Ota separates per-run evidence from reusable authority.
Pressure-testing Ota on OSF.io: staged Compose control and bounded Postgres proof
How Ota 1.6.25 modeled OSF.io's staged Docker Compose path while proving only the explicit local Postgres slice it actually executed.
One Contract, Multiple Enforcement Points for Safe AI Agent Execution
Safe AI agent execution does not come from instructions alone. One repo contract can drive local admission, required CI checks, and runtime controls without becoming competing policy.
Ota v1.6.25 Now Available: Governed CI, Trusted Replay, and Lifecycle Proof
Ota v1.6.25 adds governed CI projection, runner-authored freshness evidence, promoted replay authority, and transaction-bound lifecycle proof.
Pressure-testing Ota on Hasura: raw Kubernetes manifests and honest kubectl proof
How Ota 1.6.24 governed Hasura's raw Kubernetes manifests while keeping local kubectl rendering, Kubernetes API acceptance, and application readiness separate.
mise Resolves Tools. Ota Governs Repository Acceptance.
mise resolves repository tool environments. Ota governs the declared setup, canonical verification, safe execution, and bounded evidence required for a selected repo path to count as accepted.
AI Agent Contracts Cannot Define Repository Acceptance
An agent contract can govern how an AI changes code. It cannot by itself define the executable setup, verification, and evidence a repository needs for a change to count as accepted.
Testing the Proof System: Negative Controls and Dependency Evidence in Ota
How Ota separates dependency reachability, transaction-bound seam exercise, and validated negative controls without turning any red exit into causal proof.