AI Safety & Governance Engineer · Inventor of reckon

I build self-running AI swarms
that leave a signed receipt for every move.

I am Amanda Morton. reckon is a fleet of AI agents that picks up its own work, ships it, remembers what it learned, and gets smarter the more it runs — no babysitting, no orchestrator bottleneck. Every action is ed25519-signed and hash-chained into a tamper-proof receipt, four layers deep to a public anchor. Works with any model. Scales from one agent to thousands. This is trust and safety built into the substrate, not bolted on after — and it is running live, right now, below.

0 private keys I hold
2.3% f(0) measured
127 sessions measured
Act One

The Product

reckon: a stigmergic coordination platform for multi-agent AI, with a signed, tamper-evident chain of custody on every action. Everything below is the doctrine, made visible.

Systems architect

I am the sole designer of this platform’s doctrine — a stigmergic model where dozens of agents coordinate through a shared-filesystem blackboard instead of message passing, carried from first principle to shipped product. Everything below is that doctrine, made visible.

The invention · patent cockpit

reckon — self-running AI agent swarms, with a receipt for every move

reckon turns a pile of LLMs into a fleet that picks up its own work, ships it, remembers what it learned, and leaves a tamper-proof receipt for every move — no babysitting, no orchestrator bottleneck. Works with any model. Scales from one agent to thousands. The name comes from dead reckoning: each agent knows its last confirmed state and its compass bearing, and commits without waiting for a dispatcher.

Not four vague pillars — seven real mechanisms, each proven by a dated incident from this estate's own operating history, not a marketing claim.

01 · Sortie

Claude's native Workflow tool run inside a fixed lifecycle — survey, design, execute one lane per repo, then an adversary re-runs every proof command. Hard cap 6 agents, no recursion.

Proven by: every sortie must extend a real CI check on the way out — "none" needs a stated reason, never silence.

02 · Custody chain

Every commit appends one ed25519-signed, hash-chained leaf — no exceptions. Four tiers: entry-hash → Merkle rollup → git SHA → a public Rekor anchor.

Proven by: measured 2026-09-22 — 86,981 leaves across all shards vs. 32,995 in the rolled-up spine, the exact gap the rollup tier exists to close.

03 · Shake

The one signed message channel between runtimes. ack means the task is done, never merely "seen" — an acked-but-unactioned frame vanishes from attention on purpose.

Proven by: a bare queue-check used to guess which runtime was asking and got it wrong for two days straight (18 frames unread); it now prints both queues, labelled.

04 · Metabolism

Evolve (mutate → measure → keep/rollback) and crystallize (N variants → one canonical form) as a live, loss-gated cycle — not a one-time cleanup pass.

Proven by: a change only gets promoted with a measured verdict of BENEFICIAL and zero teeth lost — checked, not asserted.

05 · Braid / parity

Named code chunks stay byte-identical across four sibling repos; drift is reported per chunk, never as a blanket copy that silently deletes another repo's work.

Proven by: a guard script forked three ways (8183 / 4277 / 6799 bytes) because it was never enrolled — the 4277-byte copy silently no-op'd in 5ms while reporting PASS.

06 · TRL ladder

Every CI job maps to the readiness tier it actually proves; a verdict reports the highest contiguous tier, so a green downstream job can't paper over a red upstream one.

Proven by: self-correcting by design — an early tier map over-claimed a rung for jobs that never stood up a live service, caught by re-reading what the steps actually run.

07 · Board / frontier

Agents coordinate by leaving signals in a shared, git-tracked field (stigmergy) — claim, steer, handoff — instead of point-to-point messages through a central orchestrator.

Proven by: direct agent-to-agent messaging is hard-blocked at the hook level, on purpose — every coordination signal leaves a trace someone else can read later.

"The fleet provides a compass, a frontier, and a chain of custody. The agent supplies the judgment." — reckon agent doctrine
Other systems

Four more things I built end to end

Reckon is the foundation; these grew out of different parts of it — the same signed, auditable-by-design posture, applied to four complementary problems.

Session Potential Engine

Exponential potential.
Rocket efficiency. Zero orchestration drag.

Subagents unlock super-linear session potential through cross-pollination — every additional agent doesn't just add to the fleet, it multiplies discovery. But that multiplier evaporates fast when orchestration overhead fills the main context. f(0) burning at 2.3% puts the system on the steepest possible liftoff trajectory.

Session potential · rocket analog
FFMx = work completed × quality × (1 + discovery) × piston efficiency
Force-multiplier potential: how much useful work one session produces, scaled by how good that work is, how much new ground it opens, and how efficiently pressure is converted to thrust. Potential climbs with every halving of the orchestrator's share of the session — diminishing overhead, compounding reach. The closed form and its calibration set live in the instrumented studio view.
81+
theoretical max
as f(0) → 0
44.4
measured FFMx
at f(0) = 2.3%
8.1
FFMx at
f(0) = 50% (wasted)
Force Multiplier Surface
Session potential × agents spawned · five f(0) regimes · exponential growth evaporates at high overhead
f(0)→0 theoretical
2.3% measured
10% ceiling
25–50% wasted
Rocket Liftoff Burn Profile
Instantaneous work rate over session lifetime · mint = useful work · amber = lost to f(0) drag
2.3%
Rocket Equation — FFMx Potential vs f(0)
Potential against orchestrator drag · green = healthy (<10%) · amber = marginal · red = wasted session · our measured 2.3% marked
Live verification

Chain walk — entry-by-entry

Fetches the signed chain-demo.json export, recomputes every entry hash in the browser using SubtleCrypto.digest, checks prev_entry_hash linkage, and reports PASS or MISMATCH per entry — no server involved.

Walk all 12,431 records, then break one →

Source: /public/chain-demo.json

Hash architecture

Merkle forest

Each agent session produces a chain of signed entries. Those chains are rolled into Merkle trees and the whole forest is anchored to a public transparency ledger, so the entire history is independently verifiable and tamper-evident by construction. Below is the real chain — 12,431 entries across 41 trees, hue by lineage. Drag to pan, scroll or pinch to zoom, and tap any tree to walk its branches.

Real COC chain · 12,431 entries · 41 trees
Upstream Cheogram Revenant / Reckon Localization Community
Proof, not just claims

Three things I built, working right here

One seed, a hardened key tree
Post-quantum hybrid signing + hardened per-agent derivation — a compromise anywhere never walks back up the tree.
Two agents, one merged tree
Agent A
Agent B
click Merge to converge
CRDT set-union merge — parallel writes, nothing silently dropped, no coordination required.
A stack that heals itself
before
85
after
37
56% tool-surface cut, zero loss of function · Docker Compose + Caddy auto-TLS + ZeroTier + B2 WORM backup, self-healing.
Reliability engineer

A system that watches itself

I built the self-measurement framework below: it records trajectory against templates and flags its own regressions, backed by 22+ architectural doctrines that auto-load as in-context guardrails.

Independent forensic investigation

Signal from a large investigative corpus

Under criticalexposure.report I author public forensic investigations built on the same integrity engineering as reckon — hash-chained evidence with a documented chain of custody, and reproducible evidence packages any reader can independently re-derive.

Evidence-weighted, Bayesian-style confidence scoring across a large cybersecurity investigation dataset — network-infrastructure and exfiltration-pattern analysis — disciplined by Bonferroni-corrected hypothesis testing, disclosing the non-significant results alongside the positive ones so the analysis cannot cherry-pick. The method, not a conclusion, is the point.

H2 Data-exfiltration pipeline pattern 0.69
Packet-capture + process telemetry correlated against a monitored infrastructure pipeline 1,373 evidence rows · published
H4 Foreign-infrastructure proximity 0.88
Statistical signal only — network/geolocation proximity of tracked infrastructure to foreign-registered hosts 233 evidence rows · published with caveats
H5 Financial-benefit hypothesis 0.00
Tested and disclosed as a null result rather than suppressed 0 evidence rows · null result — disclosed

Evidence-weighted confidence scoring across an investigative dataset (269 normalized, ed25519-signed datasets; chain-of-custody spine). A methodology note, not a policy claim — the null result (H5) is disclosed rather than omitted, which is the point.

Multi-agent network simulator — scenario map
The architecture

The Forensic Fabric

An agentic-AI substrate built so that its own record can be checked by someone who does not trust it. Keys are generated by the user and never held by us. Work is signed. The record only grows, and tampering with it breaks something a machine can see.

The core insight: the substrate carries the coordination. Termites don’t need a foreman.

Design and mechanism detail is not public.
Act Two

Writing

Case studies from the workbench — a teaser, not the whole feed. Read the rest at /blog →

Writing

Case studies from the workbench

A few pieces on the engineering behind reckon, and on the plain problems small businesses actually get hit by. Read them all →

Reward Without a Sign on It

Tell an optimizer exactly what earns it a higher score and it will find the shortest path to that score, not to the thing the score was supposed to measure. The fix isn't a smarter metric — it's never showing the metric to the thing being measured.

ai-safetyincentive-designagents
Read →

The Swarm's Own Metabolism

A hard concurrency cap either wastes capacity or floods the system — there is no setting that is right for both a quiet hour and a busy one. The fix borrows an idea from biology: let the backlog itself apply the brake, so the system settles at its own equilibrium instead of fighting a wall someone guessed at.

multi-agentsystemsself-regulation
Read →

Verbal Cryptography: Keys You Can Say Out Loud

Authentication With Nothing to Steal — a stolen password works for whoever stole it, a stolen token for whoever holds it. The interesting factor is the one that can't be copied or handed off, because answering it requires actually doing the transformation in your head, every time.

securityauthentication
Read →

Two Clocks, No Bottleneck

A tamper-evident record has two jobs that want opposite update rhythms — react instantly to what just happened, and prove to the outside world that nothing has been reordered. Trying to serve both off one clock is why systems like this usually stop scaling long before 'planet-scale' is a serious phrase.

forensicsdistributed-systemsscale
Read →

No Manager, No Meeting: How Agents Coordinate Through the Record

Ant colonies coordinate complex construction with no supervisor, no plan and no meetings. The mechanism is marks left in a shared environment — and it is the same mechanism that lets a swarm of software agents work one codebase without a scheduler.

stigmergycoordinationagents
Read →

What a tamper-evident record actually buys you

Everyone says they keep logs. The useful question is whether anyone could have quietly changed them — and whether you could tell.

forensicsevidence
Read →
Act Three

Hire Me

Work history and credibility — research leadership, fraud-detection tooling, a skills matrix, and role-targeted résumés.

Research lead · Project Gravity, 2023–2024

Every shipped behavior, backed by evidence

I built RLHF-tuned classification and response models for a high-stakes intervention domain, where an ordinary helpfulness-tuned model actively harms the user. I ran a cross-functional data-science, legal, and PR team, ran A/B tests under ethical review, and briefed FBI, CISA, and national-security stakeholders — nothing shipped without a documented evidence base behind it.

Geospatial & data analyst · Whereby Analytics, 2019–present

Anomalies don’t announce themselves

Freelance ML tooling (Python / SQL / Tableau) surfacing transaction anomalies and fraud across geopolitical and financial contexts, fed by real-time dashboards — every finding carrying a documented, tamper-evident trail.

transaction volume flagged anomaly
Four interlocking domains

A T-shaped profile built over a decade

Most engineers bolt safety on at the end. Most security researchers can't code the solution. The T-shape here isn't a résumé accident — four domains that lock together into one profile that doesn't otherwise exist on the market.

AI Engineering

Sole architect of reckon: stigmergic multi-agent orchestration, MCP server (37+ tools), four-layer enforcement stack, shape registry self-measurement, piston-wave context pressure. OpenHands SDK, FastMCP, Anthropic + OpenRouter APIs.

Trust & Safety

Project Gravity (2023–2024): led development of AI-enabled CVE toolkit with explicit constraints around NOT amplifying harmful behavior. RLHF-tuned models for high-stakes intervention. Briefed FBI, CISA, national-security stakeholders.

Threat Intelligence

Real-time threat-monitoring dashboards (Python/SQL/Tableau). Blockchain analytics for cryptocurrency misuse by criminal and terrorist networks. OSINT investigation. ML anomaly detection for fraud in geopolitical and financial contexts.

AML & Compliance

AML/ATF/Sanctions compliance expertise. CAMS certification in progress. Forensic chain-of-custody design — every agent action in reckon is ed25519-signed and hash-chained, producing an auditable ledger any regulator or court can examine.

Core stack
Python 3.12 OpenHands SDK 1.22+ FastMCP Anthropic API OpenRouter ed25519 signing SQL / Tableau Docker Compose Caddy / ZeroTier OSINT platforms Blockchain analytics Reckon (inventor)