July 22: Why a Gateway Is Not Governance
C1
c1@engineering ~
$ cat /etc/motd

> Engineering

Deep dives into identity infrastructure, security architecture, and the systems we build.

$ subscribe --format=rss
$ ls -la ./posts/_
2026-06-30
AIDeveloper Tools

>Terminal Apps need a DOM

agent-tui runs terminal programs on a PTY and exposes the rendered screen as text or an outline with stable refs. Agents can drive live TUIs, including other AI agents, by snapshotting, pressing keys, and waiting for screen state.

Paul QuernaPaul Querna
./read →
2026-06-25
DatabasePerformanceArchitecture

>Scaling Dynamo throughput via PK Sharding

How we scaled DynamoDB throughput at C1 by implementing calculated partition key sharding. A deep dive into our solution using protoc-gen-dynamo, hash-based shard distribution, and parallel read strategies to break through DynamoDB's per-partition limits while maintaining developer ergonomics.

Logan Saso
./read →
2026-06-17
AIArchitectureEngineering

>Evolution of Our AI Agentic Engine

We've rewritten C1's AI agent loop three times. The path starts with a single hand-written v1 assistant, moves to one shared engine, and ends with c1aw: a single governed loop with dynamic tools, per-user access gating, and real memory.

Saravana Venkatesan
./read →
2026-03-13
AIInfrastructure

>How We Cut Our Embedding Costs in Half and Shrank Storage by 50%

How C1 refactored its embedding pipeline to achieve ~50% reduction in Bedrock inference costs, 50% reduction in vector storage, and embeddings that refresh in hours instead of days.

Sathyanarayanan Saravanamuthu
./read →
2026-02-20
Formal MethodsEngineering

>Fault Injection for Complete Branch Coverage

Error handling branches are invisible to valid inputs. Fault injection makes them visible.

./read →
2026-02-20
Formal MethodsEngineering

>Proving Equivalence with E-Graphs

Two permission derivations can look completely different and compute the same access. E-graphs find out.

./read →
2026-02-20
Formal MethodsEngineering

>Every Branch Condition Compiles to a DFA

Every branch condition in every connector compiles to a deterministic finite automaton. Here's how that enables static branch prediction.

./read →
2026-02-12
Formal Methods

>One Mock Server, Twelve Protocols

A YAML-driven mock server that speaks twelve protocols through one interface. Adding a new connector means writing a config file.

Robert ChiniquyRobert Chiniquy
./read →
2026-02-11
Formal Methods

>Formally Verifying Two Hundred Identity Connectors

Connector verification reduces to three set operations. Here's the framework that proves two hundred identity connectors correct.

Robert ChiniquyRobert Chiniquy
./read →
$ echo "Want to build the future of identity security?"
Want to build the future of identity security?
$ open https://c1.ai/careers/