Proof-carrying AI controllers are the organoid governance gap
A new NSF award to Georgia Tech wants safety guarantees for neural network controllers to be computed during training, not checked after deployment. Nothing in the project touches living tissue. But the pattern it funds, verification woven into design, is precisely the capability that closed-loop computing on living neural tissue does not have and will eventually be asked for.
Source: Differentiable Reachability for Scalable Verification and Safe Training of Neural Network Controllers, NSF award 2625831, Georgia Tech Research Corporation. Primary source. Read: the full award record via the NSF awards API, retrieved 2026-09-16. This award starts 2027-01-01 and reports no results; everything below about engineering systems is designed, and everything about living tissue is my analysis of the pattern, clearly flagged as such.
What the work claims
The project, led by Samuel Coogan with Glen Chou as co-principal investigator at Georgia Tech, is a standard grant from NSF's Electrical, Communications and Cyber Systems division, funded at $495,000 with an estimated total of $495,000 and running 2027 to 2029. Its central claim is that safety verification for learning-based feedback controllers can be made fast, scalable, and differentiable, so that a guarantee about what the system will never do can be computed and even improved while the controller is being trained, rather than verified once afterwards and patched when it fails.
The tool is reachability analysis: computing the set of all future states a dynamical system may enter, which gives a rigorous basis for certifying properties such as obstacle avoidance or staying within operating limits. The award record states plainly that traditional reachability methods are slow, do not scale to high dimensions, and cannot be differentiated, which makes them impractical during design. The project proposes to fix all three at once.
How it works
Three mathematical ingredients are named in the award record. Monotone systems theory and contraction theory describe how nearby trajectories of a dynamical system evolve relative to each other; systems with these properties forget initial differences in structured ways, which lets you bound whole families of trajectories at once instead of simulating each one. Interval analysis rigorously encloses quantities between upper and lower bounds. Together these yield efficient overapproximations of reachable sets, outer bounds on where the system could go, that scale to large systems and to neural network controllers.
The second move is implementation. By building the machinery in JAX, the Python framework for automatic differentiation with graphics processing unit acceleration, the reachability computation itself becomes differentiable. That means the safety margin can be backpropagated through: the controller can be trained with built-in safety and tracking guarantees, because failing the safety computation now produces a gradient that training can minimize. The record extends the framework to motion planning and to perception-based control from camera images, with validation on robotic testbeds including bimanual manipulation.
Note what this inverts. Conventionally you train a controller and then verify it, and verification failures send you back to retraining. Here the verification problem is part of the loss landscape, so the system is optimized to be provably safe, not merely tested and found safe.
Where a skeptic should push
Start with the obvious: this is a design document. The award was made in August 2026, work starts in January 2027, and the record contains no results. Every claim about speed, scalability, and differentiability of reachability for neural controllers is a proposal, not a demonstration. The robotics testbeds are named as validation targets, not as completed experiments.
The deeper issue is what the mathematics assumes. Monotonicity and contraction are properties of engineered plants whose dynamics are known, stable in structure, and specifiable. Reachability overapproximation is only as tight as the model of the plant; a conservative bound can be so loose it certifies nothing useful, and the award record does not quantify how conservative the bounds will be. Even within engineering, the gap between a verified model and the physical system is the classic soft spot of formal methods: you prove things about the model.
And nothing in scope here is alive. The load-bearing assumption in the next section, that this pattern transfers to controllers acting on living tissue, is my inference and must be weighted accordingly. Living neural tissue adapts, drifts, dies, and changes its own dynamics in response to exactly the stimulation a controller applies. Whether contraction-like structure exists in organoid dynamics at all is an open empirical question, not a premise.
Verification as the organoid access gate
Now the grid question: what does this change for platform access, vendor capability, and the governance of computing on living neural tissue?
Closed-loop organoid training, the direction the field is openly heading, applies stimulation chosen by a learned controller and adjusts it from the tissue's response. Today's safety case for such loops is empirical and ex post: watch the recording for seizure-like activity, depolarization block, or cell stress, and stop when it appears. That is a circuit breaker, not a guarantee. The pattern this award funds points at what a stronger regime would look like: a stimulation policy that carries a proof, computed against a model of the tissue, that its outputs stay inside a certified envelope for the duration of a session. A platform that can offer proof-carrying controllers is offering a different product from a platform that offers a stop button, and access regimes, liability, and procurement will eventually price the difference.
Three non-obvious consequences follow. First, the model becomes the governance object. A reachability proof is relative to a dynamical model of the plant, so for living tissue the certification authority implicitly migrates to whoever supplies and maintains the tissue model: the platform vendor, the electrophysiology toolkit maker, or a consortium. A regulator auditing a certified organoid training run would in practice be auditing a model library, which is software governance wearing tissue governance's clothes.
Second, differentiability changes the ethics of the constraint. When a safety margin produces a gradient, moral constraints become tunable terms in a loss function, with weights. A system trained to respect a stimulation envelope can also be trained to trade a little envelope for a little performance. There is nothing scandalous in that; engineering is full of such trade-offs. But the governance literature on organoids has not yet absorbed a world where the difference between an acceptable and an unacceptable intervention on living neural tissue is set by a hyperparameter chosen during training, possibly by a platform operator the tissue's originators never meet.
Third, there is a genuine threat alongside the opportunity. Formal verification is expensive and expertise-bound; if proof-carrying controllers become a de facto requirement for closed-loop tissue work, the cost of entry rises and capability concentrates in the few vendors who can afford the verification stack. The opportunity is real too: a shared, auditable verification layer for stimulation policies could be the first piece of organoid infrastructure that makes safety claims inspectable by outsiders rather than trust-me statements, which is a precondition for any serious public access program.
None of this is promised by the award, which is about robots and aircraft. The claim worth taking seriously is narrower: the field now has a funded, dated, specific program showing what verification-inside-training looks like for neural controllers. When oversight of living-tissue computing matures from principles to requirements, this is the shape the requirements will borrow.
The bottom line
Established: NSF has funded a specific, technically concrete program to make reachability-based safety verification of neural network controllers differentiable and fast enough to live inside training, using monotone systems theory, contraction theory, interval analysis, and JAX. Not established: any result, since the work begins in 2027, and any application to living systems, which is outside the award's scope and is my analysis here. What would confirm the transfer I have argued for: a published organoid dynamics model with enough structure for contraction or interval bounds to bite, and a reachability certificate computed against it. What would break it: evidence that organoid adaptation changes the effective dynamics on timescales shorter than any session a certificate covers, which would make certified envelopes fictional. Until one of those happens, treat proof-carrying controllers as the right question for organoid governance, not an available answer.
Frequently asked questions
What is reachability analysis?
It is a formal method from control theory that computes the set of all states a dynamical system could possibly enter over some time horizon. If that set excludes every unsafe state, you have a mathematical guarantee of safety, not just an absence of observed failure.
What does making reachability differentiable actually buy?
If the safety computation can be differentiated, it can be placed inside the training loop of a neural controller, so the training process itself optimizes for satisfying the safety property. The award record calls this training with built-in safety and tracking guarantees.
Does this project involve organoids or living tissue?
No. The award covers robots, autonomous vehicles, and similar engineered systems, with validation on robotic testbeds. The connection to computing on living neural tissue drawn in this analysis is an interpretation of the design pattern, not a claim by the project's authors.
Why would proof-carrying controllers matter for organoid platforms?
Closed-loop training of living neural tissue currently relies on stopping when recordings look harmful. A controller that carries a proof its stimulation stays inside a certified envelope would turn that circuit breaker into a guarantee, which would change procurement, liability, and eventually public acceptance of shared or cloud-based organoid platforms.
What is the main risk of importing this pattern?
Certificates are relative to a model of the system. For living tissue, the model supplier becomes the hidden governance authority, and a certificate against a bad model is worse than no certificate because it discourages scrutiny. Moral constraints expressed as differentiable penalties can also be traded against performance in ways current organoid oversight frameworks do not contemplate.
References
- Coogan S, Chou G. Differentiable Reachability for Scalable Verification and Safe Training of Neural Network Controllers. NSF award 2625831, Georgia Tech Research Corporation, awarded 2026-08-06. https://www.nsf.gov/awardsearch/showAward?AWD_ID=2625831. Accessed 2026-09-16.