After workload commitment
Model / accelerator efficiency → IT electricity → heat removal → cooling → water strategy → grid coordination → emissions / infrastructure response
TA-14 ACA · VERSION 1.1 · PUBLIC DATA-CENTER RESEARCH SHOWCASE
The world is working to make rapidly growing computation more efficient after workloads exist. TA-14 Admissible Computation Architecture asks an earlier question: what must be true before a proposed computational path has sufficient standing to become workload at all?
THE GAP TA-14 ACA IS TESTING
Model / accelerator efficiency → IT electricity → heat removal → cooling → water strategy → grid coordination → emissions / infrastructure response
Request → Proposal → admissibility → binding → COMMIT → computation → existing efficiency stack
ACA is intended as a complementary upstream layer. It does not replace efficient chips, better models, advanced cooling, workload shifting, renewable power, water stewardship or grid flexibility. It asks whether some demand can be avoided, bounded or resized before those systems ever have to serve it.
THE COMPUTATIONAL COMMITMENT BOUNDARY
A system may be technically capable of generating, retrieving, simulating, routing, calling tools, spawning agents or retrying work. That capability does not by itself establish that the exact proposed branch, under the exact current conditions, should consume resources. ACA introduces an explicit decision boundary before commitment.
The bounded proposal has sufficient standing to proceed.
Required evidence, context, identity, scope or continuity is insufficient.
The proposal does not have sufficient standing to consume the requested resources.
The decision requires an authorized route outside the current gate.
WHAT COULD BE STOPPED, HELD OR RESIZED?
The strongest data-center hypothesis is not that entire user requests disappear. It is that high-volume computational systems contain branches whose standing can fail before commitment.
Work that repeats an already-satisfied objective without adding required value.
Computation proposed from context that materially changed before commitment.
Retrievals, tools, agents or model calls that exceed the bounded objective.
A request that may deserve an answer, but not the amount or class of compute proposed.
Retries or continuations whose prior standing no longer survives changed conditions.
Work whose purpose, target, authority or expected consequence cannot be sufficiently bound.
WHY THIS COULD MATTER AT DATA-CENTER SCALE
TA-14 ACA does not claim that a denied model call equals a fixed quantity of electricity, water or carbon. The research proposition is narrower and stronger: first establish whether upstream governance reduces net downstream computational work after including the cost of the gate. Only then test whether the reduction is large, repeatable and attributable enough to matter physically.
Each attribution level requires additional evidence. The architecture intentionally prevents a computational result from silently becoming an environmental claim.
THE FOUNDING PILOT
Define objective, context, resource class, quality threshold and baseline before the comparison begins.
Measure the existing architecture exactly as it operates without the ACA gate.
Apply admissibility before commitment and preserve ALLOW, HOLD, DENY and ESCALATE decisions.
Gate overhead, admitted work, avoided work, retries, latency, quality, false rejection and false admission.
Only where supported, connect compute differences to IT energy, thermal load, cooling, water or grid effects.
Positive, null, negative and inconclusive outcomes all remain admissible research findings.
WHO SHOULD TRY TO DISPROVE THIS?
ACA becomes meaningful only if researchers and operators with real workloads, telemetry and facility data can test it. The Exchange Research Network is being built around the communities best positioned to answer the question.
Test whether workload admission can complement efficiency, cooling and demand-response systems.
Measure whether upstream computational governance produces facility-relevant reductions after gate overhead.
Examine whether avoided or reshaped compute changes demand before load-management mechanisms engage.
Stress-test the falsifiable proposition, accounting boundary and environmental attribution ladder.
Test inference, retrieval, tool-use, agent branching, retry and routing workloads.
Determine when compute reductions are actually attributable to thermal, cooling or water effects.
Govern before computational commitment.
Live cumulative activity recorded across the public Exchange surface.