Hardware-Level Governance of AI Compute: A Feasibility Taxonomy for Regulatory Compliance and Treaty Verification
Not on the map. Why?
Abstract (arXiv)
The governance of frontier AI increasingly relies on controlling access to computational resources, yet the hardware-level mechanisms invoked by policy proposals remain largely unexamined from an engineering perspective. This paper bridges the gap between AI governance and computer engineering by proposing a taxonomy of 20 hardware-level governance mechanisms, organised by function (monitoring, verification, enforcement) and assessed for technical feasibility on a four-point scale from currently deployable to speculative. For each mechanism, we provide a technical description, a feasibility rating, and an identification of adversarial vulnerabilities. We map the taxonomy onto four governance scenarios: domestic regulation, bilateral agreements, multilateral treaty verification, and industry self-regulation. Our analysis reveals a structural mismatch: the mechanisms most needed for treaty verification, including on-chip compute metering, cryptographic proof-of-training, and hardware-embedded enforcement, are also the least mature. We assess principal threats to compute-based governance, including algorithmic efficiency gains, distributed training methods, and sovereignty concerns. We identify a temporal constraint: the window during which semiconductor manufacturing concentration makes hardware-level governance implementable is narrowing, while R&D timelines for critical mechanisms span years. We present an adversary-tiered threat analysis distinguishing commercial, non-state, and nation-state actors, arguing the appropriate security standard is tamper-evident assurance analogous to IAEA verification rather than absolute tamper-proofing. The taxonomy, feasibility classification, and mechanism-to-scenario mapping provide a technical foundation for policymakers and identify the R&D investments required before hardware-level governance can support verifiable international agreements.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Apr 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Hardware Mechanisms to Dynamically Throttle AI Performancecited by 0
- 2026Privacy-Preserving AI Verification via Minimal Information Disclosurecited by 0
- 2026Beyond Training: A Feasibility Taxonomy for Inference-Time AI Governancecited by 0
- 2026Can Power Draw Constrain Covert Compute? Limits of Analogue Verification for AI Governancecited by 0
- 2026Can Power Draw Constrain Covert Compute? Limits of Analogue Verification for AI Governance5 Oct 2026
- 2026Beyond Training: A Feasibility Taxonomy for Inference-Time AI Governance9 Sep 2026
- 2026Privacy-Preserving AI Verification via Minimal Information Disclosure3 Aug 2026
- 2026Hardware Mechanisms to Dynamically Throttle AI Performance20 Jul 2026