patch-gap-hot-search: a synthetic HOT-searcher toy for the governance patch-gap

Bilar, Daniyel Yaacov · 2026-10-09 · software · mit-license · v0.2.0

Version of record (concept DOI, always latest zip): https://doi.org/10.5281/zenodo.21918091
This version (v0.2.0): https://doi.org/10.5281/zenodo.23262639
Download zip (Zenodo): open
GitHub companion: github.com/chokmah-me/patch-gap-hot-search (release v0.2.0)
Companion paper (separate concept): 10.5281/zenodo.21910874
OSF (legacy mirror): osf.io/5pjcv
Sketchnote for The Governance Patch-Gap, companion visual for the HOT-searcher toy

Companion sketchnote from the patch-gap paper (CC BY 4.0). Full-size PNG.

Abstract

A Python, stdlib-only toy companion to The Governance Patch-Gap. It generates a discovery rate Rd from a label-blind interface searcher on a Highly Optimized Tolerance (HOT) rule graph. The patch-gap G = Rd/Rp and the stocks Sknown and Sactive are outputs of that toy, not fitted measurements of any legal system.

The paper defines G and maps legal open texture onto HOT / robust-yet-fragile design. This software exists so those qualitative distinctions can be run: a searcher produces Rd, a patcher produces Rp, and G and S emerge. It does not estimate Congress, courts, or any statute book.

Version 0.2.0 adds four gates without changing the toy dynamics: Lean 4 proofs of the paper's §4.3 stock algebra; a recomputation of the §4.4 regime arithmetic against the paper text; a 162-cell searcher sweep frozen before its first run; and a figure/prediction ledger that fails on drift. Cite the paper concept for the argument; cite this software concept for the runnable artifact.

Keywords

AI governance · open texture · reward hacking · regulatory arbitrage · highly optimized tolerance · governance patch-gap · legal exploit discovery · computational claim gate · synthetic rule graph

← All research