# §09 Part 7/8 — Bring One Real Boundary: Peer Review & R&D Evaluation Canonical: https://blayneaina.com/09-bring-one-real-boundary-work-with-blayne/part-7/ | Raw Article: https://blayneaina.com/09.md | Next Part: https://blayneaina.com/09/part-8.txt ## Bring the Boundary Bring one AI-proposed mutation, one hostile document, or one duplicate-record problem. Include the operating owner, the handling constraints, and the question you need answered. We will establish the exact transition, predeclare acceptance and refusal, run the appropriate existing implementation, and return the evidence and its ceiling. If the result supports a next step, we can scope it. If it fails or remains unresolved, that result stays visible too. > **Bring one real boundary. Make the result inspectable before deciding what comes next.**

Technical & Security Due Diligence FAQ

These are the concrete mechanisms and assurance ceilings behind a technical walkthrough. Each answer links back to the relevant architectural proof surface.
1. How can an already-authorized operation become a different operation between human approval and execution, and what precise mechanism prevents it? A high-level tool call can be approved at time t1 and mutated before execution at t2: a path or image can be substituted, child arguments or environment state can change, or an inherited writable handle can address an unapproved target. AINA binds approval to a controller-fixed, RFC 8785 JCS-hashed RequestedAct before the worker environment exists. The worker is spawned suspended inside a restricted Job Object; the pre-resume audit observes its token, image and handle inventory before instruction 0. requested_act::validate re-resolves current task, source, tenancy, destination and act identity at execution. A mismatch such as requested_act_mismatch or an unclassified pre-resume capability fails closed; no resume or destination mutation occurs.

Proof: §07 Act Pinning · actual refused-substitution receipt and unchanged SQLite digest

2. What happens when an agent or local process already holds a writable handle to a file before the kernel lease is established? The lease cannot be granted. On Windows, the coordinator opens the target with FILE_SHARE_READ and without write/delete sharing. If another process already holds a compatible writable handle, the kernel rejects the coordinator's open with ERROR_SHARING_VIOLATION (os error 32). Acquisition fails closed, no generation token is issued, and the territory remains contested until the foreign handles are closed and the baseline is re-verified. The gate does not pretend that a clock expiry revoked a handle the OS still holds open.

Proof: §05 Kernel Write Exclusion · os_lock_conflict in leases/oshandle.rs

3. What happens when the protected destination changes out-of-band after authorization but before final commit? Authorization binds a baseline file digest or SQLite row version; it does not authorize whatever bytes happen to exist later. At commit, file guards recheck the current preimage and tenancy while SQLite uses an immediate write reservation and a conditional UPDATE ... WHERE version = expected. A drift produces preimage_hash_mismatch or record_version_changed rather than an overwrite. Where candidate file bytes exist, divergence is preserved for forensic review rather than silently laundering it into a clean baseline. Quarantine is mechanism-specific, not a claim that every refused API call creates Amber bytes.

Proof: §03 Deterministic judgment · §05 fencing · §07 fenced SQLite

4. What happens after a successful database commit or atomic rename followed by a crash before the receipt reaches the caller? The operation is treated as in-doubt, not blindly retried. Durable operation identities and pre/post execution records let recovery determine whether the effect committed. A fresh successor task can receive a narrowly scoped result_read_only grant to inspect the historical outcome after its tenancy, grant, source, delivery, and receipt bindings validate. The successor does not re-execute the mutation and does not fabricate the original worker's first receipt: satisfies_original_return: false and resolves_original_obligation: false.

Proof: §07 crash continuity and successor grants · result_grant_* refusal family

5. How does Semantic Switch preserve useful matching relationships without exposing native identifiers, and what are its actual limits? For structured CRM and logistics records, Semantic Switch replaces lexical identifiers with deterministic surrogates while preserving equality relations, edit-distance structure, blocking keys, and graph topology. A confined worker can perform blind entity-resolution tasks without receiving raw customer identifiers in its prompt. It is an experimental alpha relational-confinement layer, not encryption or universal anonymization. Tokenizer boundaries, unconstrained prose, frequency analysis, auxiliary-data correlation, and production matching accuracy remain outside the demonstrated guarantee.

Proof: §03 production EISA core and alpha module · synthetic invariance testbed

6. What attacks have been tested against transformed records, how do you distinguish preserved relationships from re-identified entities, and what evidence exists beyond synthetic fixtures? Current public validation is limited to deterministic synthetic invariance fixtures and offline verifier behavior. The 20/20 block and 23/23 relation results test structural transport fidelity, not anonymity or population accuracy. I have not completed formal frequency-analysis, auxiliary-graph reconstruction, or production-corpus re-identification benchmarks, and no such guarantee is claimed. The dedicated isomorphic prototype's result is not evidence that every generator branch preserves every tokenizer or semantic relationship.

Proof: published fixtures, harnesses, and alpha claim ceiling

7. What is the smallest useful deployment of AINA in a real company today? One deterministic mutation gate around one high-consequence workflow. For example, gate AI-proposed merges in a HubSpot or Salesforce deduplication workflow: validate the act and baseline, require current tenancy, revalidate the destination at commit, and record rejected proposals instead of silently corrupting production records. You do not need to deploy every mechanism or migrate the whole company to begin proving value.

Proof: §01 machine standing · §06 forensic history · public refusal exhibit

8. What are the actual latency and resource costs? There is no universal millisecond benchmark to quote. JCS canonicalization, hashing, EISA evaluation, handle operations, and SQLite transactions are local primitives, but their cost depends on payload, fixture, process creation, destination, filesystem, and host. The fresh 45-case battery took 118.753576 seconds end to end, including isolated fixture provisioning, process launches, document handling, and SQLite work; averaging that duration across cases does not produce a per-gate latency measurement. Specific per-operation timings and LPAC worker-spawn overhead must be measured on the admitted profile, not asserted as empirical guarantees.

Proof: fresh execution timing and candidate attestation · §08 assurance boundary

9. What happens when the governing controller itself is compromised by a local administrator or kernel exploit? AINA does not claim to defeat a hostile OS kernel, ring-0 rootkit, or administrator controlling the same host. The local interactive-console owner, operating-system kernel, and controller host are inside the v1 trusted computing base. The current runtime confines untrusted model outputs, hostile documents, and concurrent workers beneath that controller. Hardware attestation or multi-node enclave designs are outside the current implementation and are not represented as deployed capabilities.

Proof: §08 sovereign stop and its trust boundary

10. How much of the architecture is deployable across multiple machines, and which parts have run in customer production? The unified AINA reference runtime, Room coordinator, and 45-case gate were built and exercised on a single Windows workstation as independent R&D. They have not yet been deployed as a unified system in an external enterprise production environment. The 11+ years of production history is the underlying delivery record: CRM data hygiene, multi-company ETL migration, 800+ carrier workflows at DrayMaster, deterministic operational state machines at Photector, and HubSpot/Salesforce integration work. That experience informs the architecture but is not represented as external production validation of AINA itself.

Proof: this deployment boundary · local candidate evidence and its stated ceiling

11. What is the smallest useful deployment of AINA in a real company today?

The smallest practical enterprise deployment is a single CRM/database mutation gate wrapping §01 (proposal versus act), §03 (deterministic EISA checks), and §06 (pre-image and forensic vaulting). An existing model or subagent interacting with HubSpot, Salesforce, SQLite, or another relational store is placed behind one MCP tool boundary. The gate validates the controller-fixed RequestedAct, checks optimistic row versions, journals the pre-attempt state, and requires unapproved substitutions to fail closed with zero database effects. The whole nine-module architecture is not a prerequisite.

Proof: §01 output boundary · §06 dual-tier recovery · Case C SQLite refusal proof

12. What are the actual latency and resource costs?

Operational gate latency and full-lifecycle test duration are different measurements:

Proof: binary composition and timing note · candidate attestation

13. Which components come from real customer production environments vs. independent R&D?

AINA keeps enterprise delivery history separate from the unified reference runtime:

Proof: this production boundary · offline verification bundle

14. How can a security researcher, peer reviewer, or R&D funding evaluator verify the runtime beyond the static proof pack?

Verification has two tiers:

  1. Offline cryptographic verification (immediate): Download aina-refusal-proof-pack-v1.zip and run python verify_refusal_proof.py locally without internet access to audit all four refusal records, 12 schemas, and the 45-case manifest against published SHA-256 digests.
  2. Live interactive walkthrough (peer-review & diligence session): In a 45-minute technical screen share, the reviewer or evaluator chooses an ad-hoc destination target, unauthorized parameter substitution, or simulated lease collision and observes the running worker refuse the mutation while the destination remains unchanged.

Proof: Refusal proof pack · Schedule a live boundary walkthrough (me@blayneaina.com)