- The root argument: that existence, status, the moral ought, and legitimate authority are conferred and re-spoken rather than self-standing, and what that means for the standing of a made mind. Built and broken against itself, honest about where it fails.
Research program
Research
The thinking under the workshop: systems papers, bounded experiments, and workflows you can inspect and reproduce.
Zain Dana Harper/ Seattle · 2025 to 2026/ authored · dated/ github.com/HarperZ9
How to read this
This page is an index, grouped into three parts. The theses carry the long arguments: artificial minds, communication between bounded agents, and what a verdict can actually say. The experiments put pieces of those arguments into bounded tests. The demos include recorded workflows with their evidence packages and a browser-native byte witness. Each entry is labeled by where it stands, and where a result is not proven, the page for it says so plainly instead of turning a gap into a claim.
Status ladder
New entries use stricter labels so source intake, local probes, verifier matches, and unproven claims do not collapse into one vague word.
- SOURCE_LEAD
- A source worth gathering, not yet a factual claim.
- HYPOTHESIS
- A plausible claim with a falsifier or missing experiment.
- IDENTITY
- A mathematical or system identity with a proof sketch, derivation, or executable model.
- PROBE_MATCH
- A bounded local computation matched the expected behavior.
- CRUCIBLE_MATCH
- A claim matched its measurement packet under Crucible.
- UNVERIFIABLE
- Evidence is insufficient, inaccessible, or outside scope.
- LAW_CANDIDATE
- A repeatable invariant with scope and falsification, not a promoted law.
Theses
The argument, in long form. Authored, dated, and stress-tested against its own weakest joints.
- What actually crosses between two minds: not bits, but faithfulness to a named criterion. From that follows a neutral center where two differently-perceiving minds reconcile, and the one boundary where a human still has to stand. A reviewable draft, every claim labeled by where it stands.
- How far a verdict reaches: it binds only where its criterion is witnessed outside the system and can be re-derived. Past that line it is an unwitnessed bid, not a fact. A reviewable draft that ties the recent studies back to the reconcile thesis.
Experiments and results
Where the argument meets a real test. Each one returns a witnessed verdict, and where a leg is unproven it is marked UNVERIFIABLE.
- A claim from a research talk, turned into a self-checking simulation. The math leg returns a witnessed MATCH at about 0.99 percent mean error against a 5 percent bar. The physical-chip leg stays UNVERIFIABLE, and the page says so. Every number is re-checkable from a seed-fixed script.
- An assembly line that turns a witnessed research talk into a discovery card carrying its own re-check, then asks the verifier to decide. A v0 scaffold that produces candidate cards with attached falsifiers, not discoveries. Most cards are not yet decidable, and the forge says so.
- Frontier AI talks and papers turned into claim cards, each carrying its own hashed evidence from a sealed corpus. The honest count: six cards are fully grounded, five of ten modules are solidly evidence-backed, and the gaps are named rather than papered over.
- A stricter publication format for using the tools themselves to advance research: source leads, bounded probes, evidence packets, verifier checks, Learn-backed skill loops, and explicit UNVERIFIABLE boundaries. The first probe records a local failing reproduction for a pandas issue, while still blocking patch and PR-readiness claims.
- A focused Navier-Stokes proof-packet preflight: a bounded periodic skew-symmetry witness, BuildLang parity output, Lean algebraic, finite cyclic-sum, finite summation-by-parts, typed finite-grid, finite edge/operator, and vector finite-operator replay rungs, arXiv source-lead demotion, and an explicit UNVERIFIABLE boundary around the parent Millennium problem.
- A bounded biology/network-intelligence packet: verified source intake for fungal, mycorrhizal, and plant signaling literature, source-lead demotion for blocked DOI routes, Crucible and Learn receipts, and a hyphal context protocol hypothesis for sparse signal routing that still requires benchmark evidence.
- A deterministic dogfood fixture over the biology source corpus: full source-body routing versus gradient envelopes plus receipt retrieval. The hyphal route keeps the same required evidence classes and guardrails with fewer estimated prompt tokens, while model answer quality and general route superiority remain unproven.
- A receipt-only source pass over five videos and one Relentless channel queue, mapped into industrial science replay packets, causal research workbench, agentic benchmark foundry, and compute infrastructure ledger tracks. Field tracks are inferred; domain correctness remains UNVERIFIABLE until primary-source or replay evidence exists.
- A replayable toy-DAG packet for causal claims: source receipts, graph assumptions, exact adjustment-set checks, negative controls, Crucible receipts, and a Learn prooflesson. It does not claim causal discovery, LLM causal-reasoning validation, medical recommendation, or BuildLang/buildc-native execution yet.
- A replayable differential-drive robotics packet: source receipts, unit-checked command logs, predicted and observed traces, tolerance checks, safety envelope, latency boundary, negative controls, Crucible receipts, and a Learn prooflesson. It does not claim real robot safety, medical deployment, foundation-model validation, or BuildLang/buildc-native execution yet.
- A replayable 3-qubit bit-flip stabilizer packet: source receipts, logical states, stabilizers, syndrome table, correction map, negative controls, Crucible receipts, and a Learn prooflesson. It does not claim surface-code decoding, hardware QEC, fault-tolerant computation, quantum advantage, or BuildLang/buildc-native execution yet.
Demos
The recorded workflow library shows four current tool paths with short cuts, full runs, transcripts, evidence, and explicit claim boundaries. The byte witness remains browser-native.
- The one move emet makes, running entirely in your browser: re-derive the bytes of a file, compare against a claim, and report MATCH or DRIFT instead of ever saying trusted. Nothing is uploaded or sent anywhere.
- A sanitized three-repository map, a named dependency checked back to file-and-line evidence, a bounded context envelope, and an offline atlas. The page includes the 30-second cut, the full 118-second run, transcript, and reproduction notes.
- Structured source blocks enter a content-addressed local corpus, both retained records re-check against their provenance, and a changed receipt is caught. The fixture is local and makes no network request.
- One cross-domain request becomes three dependent execution waves with validator passes, checkpoints, payload handoffs, and a replayable ledger. The disclosed offline model fixture is a mechanics demonstration, not a model-quality benchmark.
- A three-claim brief moves from one measured match and two drifts to three matches without changing the thesis, followed by cleanroom reviews and a verdict re-derived from disk.
A research program still in progress. Each entry is labeled by where it stands (thesis · draft · v0 scaffold · witnessed result) and, where useful, by stricter status labels such as SOURCE_LEAD, PROBE_MATCH, CRUCIBLE_MATCH, and UNVERIFIABLE. Where a result is unproven it is reported UNVERIFIABLE rather than waved past. Get in touch: [email protected]. · Updated 2026-07-12.