Independence and (if C is infinite) uncomputability of the compactification-to-thermalisation map; anthropic patch as a conjectural computability filter (1b), independent of 1a. Concept DOI 10.5281/zenodo.19818320. OSF archive osf.io/xeuvp.
v1.0.4 methods companion to fragile-proof-audit: disposition taxonomy (BREAK/GAP/PASS/SKIP/UNKNOWN), attack types A–G, evidentiary disciplines, and a 32-gate verdict lock (17 BREAK / 15 PASS). Concept DOI 10.5281/zenodo.22926995. Companion repo github.com/chokmah-me/fragile-proof-audit.
v1.1.0 code and data for paper v1.1 (10.5281/zenodo.22908061): corrected adoption dates, first-parent snapshots, eight-repo longitudinal pilot, snapshot-scoped AI-signal audit, and check_paper_claims.py, which recomputes every number in the paper and exits nonzero on any mismatch. Concept DOI 10.5281/zenodo.20318457. MIT.
v1.1 correction release: eight errata, longitudinal pilot extended to all eight eligible repos (no Gini decline; Gini rose in 6 of 8, pooled exact Wilcoxon p=0.195), post-release audit. Cross-sectional result holds (Gini 0.882 vs 0.725, p=0.0011; p=0.027 without AI-signal Cohort A repos). Concept DOI 10.5281/zenodo.20313668. Code and data 10.5281/zenodo.22908056.
v1.4.0: Numerical evaluation of Sun arXiv:2609.04176v1 Theorem 9.1's quadratic estimate. Measured B² coefficient ~+1.85 where the proof needs ≤ −0.0097; refutes the proof route, not the rationality claim. Concept DOI 10.5281/zenodo.22830610. Companion software 10.5281/zenodo.22830201.
v0.1.0 software: Lean 4 formalization of Thm 2.1, Lemma 5.4, Thm 5.1, Lemma 5.5, Cor 5.2 §5 content from arXiv:2609.04176v1. Does not claim Theorem 1.1. Concept DOI 10.5281/zenodo.22830201. Companion paper 10.5281/zenodo.22830610.
v3.3: specification divergence; Paglieri transparent-swarm comparison; B covers the covert subset of substrate contagion. Blinded witness-set substitution remains untested. Concept DOI 10.5281/zenodo.19595987.
v2. Circular leverage in bank-NBFI SRT networks: two-stage cascade transition at λ* ≈ 0.95. Osberghaus and Schepens (2026) place market-wide self-funding near 26%. Five of six cockpit metrics show stress as of Q2/Q3 2026.
Cite-hygiene revision (v4.1) of the LatticeOS AOM note: JIATF-401 order pinned at USD 87 million; Maven PoR and Golden Dome consortium cites split onto the articles that actually say them.
August 2026 revision of Golden Dome Latency Governance: the program office now describes the automation dial this paper specified; the ISL mesh is still a target state, not a fielded path.
A turn-based multipolar crisis simulation for IR research and war studies pedagogy. Eight scenarios across thirteen domains and eight actors; browser wargame and headless Oracle API for batch runs and counterfactuals. Stylized, rule-based AI with cascade dynamics.
1. Artifact claim. Companion code and data for the v4 launcher-attrition paper and the Phase II residual-force C2 observability extension (milcom-2026-iran-attrition 0.6.1). 2. Problem / scientific context. Implements the agent-based model, Phase II residual/provocation extension, claim gates, an...
1. Artifact claim. This deposit is the Phase II companion preprint (v0.3 PDF): an empirical-and-simulation argument that, in a residual IRGC missile force after high week-one attrition, an open-source attribution-correlation proxy can discriminate active from pre-programmed C2 under sparse provoc...
Legal systems governed by rule of law are, structurally, rule systems. Like any rule system, they contain gaps between specification and intent, concentrated in the deliberately under-specified provisions that legal philosophers call "open texture." Those gaps have always been exploitable, but ex...
What this is. A Python, stdlib-only synthetic companion that 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, Sactive are outputs, not fitted legal measurements. Paper this illustra...
v1.0.4 Lean 4 + exhaustive GF(2^8) Python verifier for the invert-and-affine Möbius class bridge (ARIA four maps), plus independent-kernel accept. Companion to paper v1.0.5. Prefer software concept DOI 10.5281/zenodo.21705939. No attack complexities claimed.
The Möbius Bridge holds for every invert-and-affine S-box S = L2 ∘ Frob^j ∘ inv ∘ L1; j is the only degree of freedom. ARIA instantiates four class members. Lean 4 + exhaustive GF(2^8). No attack complexities claimed.
hashline gives LLM coding agents stable, verifiable line edits: the model refers to changes by line-number ranges instead of re-quoting old code, and a 4-hex content-hash tag on every read rejects any patch built against stale content. Works with Claude, Grok, DeepSeek, Gemini, Kimi, and any tool-using model.
Technical note reporting the hardware realization of argmax-snapped EML expression trees on Lattice iCE40 FPGAs. On fabric without DSP inference, snapped symbolic primitives (exp and ln) are simultaneously smaller and more accurate than every quantized MLP in a width/depth sweep, are bit-exact to...
Code, data, and technical notes for EML (exp-minus-ln) expression tree research. Includes symbolic regression experiments (snapping_v2_final.csv), basin-selection warm-start studies, and Track C hardware realization: fixed-point golden models, iCE40 RTL emitters, quantized-MLP and direct-ROM base...
Technical note + data release accompanying Valid and False Snapping in EML Expression Trees: The Basin Selection Problem (DOI: 10.5281/zenodo.19790799; v2.3 at time of writing). The companion paper showed that three-phase temperature annealing (Adam on MAE, entropy-penalty ramp, temperature annea...
Training EML expression trees (Odrzywolek 2026) with gradient descent and then snapping soft input selectors to discrete choices should recover exact symbolic forms for elementary functions. Prior work reported commitment-based success criteria; we add a symbolic-correctness criterion and charact...
A token-efficient AI engineering system for Claude Code providing structured workflows, agentic patterns, three-layer context optimization (don't-load, compress, cache), path-scoped rules, output compression via Headroom, and supply-chain security hardening for software development teams. This re...
A Ghidra plugin that classifies embedded firmware functions into three attestation regimes (formally provable / statistically testable / adversarial input exposure) based on the Computability Filter framework (Bilar 2026). Supports ICS/embedded firmware triage with P-code analysis, call-graph pro...
When states delegate exception-decisions to autonomous systems operating under latency constraints that preclude real-time human ratification, the sovereign position becomes formally unoccupiable. This paper derives the result from three independent impossibility constraints: Rice's theorem on be...
The core thesis is simple but devastating: there is no single scientific method to verify whether an autonomous AI agent actually possesses a claimed capability. The right verification strategy depends entirely on the agent's computational model and strategic posture (honest vs. potentially decep...
Companion to The Shibboleth Lattice: Recognition Channels and the Universality of In-Group Coordination (Bilar 2026, concept doi:10.5281/zenodo.19595987). The parent paper proposes a binding operator B unifying coalition formation across five substrates, with recognition-channel pro...
v.1.3 adds technical detail from the SentinelOne source report: fast16.sys disables the Windows Prefetcher to guarantee filesystem-filter interception of all EXE reads, delays patching activation until explorer.exe opens, and checks for at least eighteen AV products before installing.SentinelOne'...
In 2009, On nth Order Attacks (NATO CCDCOE, Responses to Cyber Terrorism) predicted that PLA shashoujian logic, read through the Highly Optimized Tolerance lens, would produce an operational signature in which state adversaries target the mission-sustaining ancillary systems of advanced computeri...
Version 1.2.0 is a major restructuring of the Quantum-Safe Migration Playbook with three goals: make the content usable as a retrieval-augmented AI knowledge base, tighten evaluation discipline, and update all dated facts to April 2026. What's new in v1.2.0 Structural changes Fact-ID indexing: ev...
For years, the quantum computing community has benchmarked its progress using simplified, independent noise models, leaving us to navigate the complexities of large-scale devices largely by feel. This commentary analyzes Google's recent out-of-time-order correlator (OTOC) experiments on the 65-qu...
Circular leverage in bank-NBFI SRT networks: simulation code
The 2026 US-Israeli military campaign against Iran produced a 92% decline in Iranian ballistic missile launch rates within nine days. This paper asks whether that decline reflects physical destruction of transporter-erector-launcher (TEL) assets, degradation of command authority, or both. An agen...
Initial release accompanying the position paper "Golden Dome Latency Governance: Autonomous Operations Model Extended to Boost-Phase Intercept Timelines" (Bilar 2026, DOI: 10.5281/zenodo.19368682 What's included simulate.py — unified falsification suite (v5.0), five scenarios A-E requiremen...
This paper provides a comprehensive open-source intelligence assessment of the People's Liberation Army's unmanned combat aerial vehicle (UCAV) arsenal as it pertains to a potential Taiwan invasion scenario. It examines the PLA's key platforms (CH-901, GJ-2 Wing Loong II, ASN-301, GJ-1/WS-43, GJ-...
This companion note analyzes the Shahed-238 jet-powered one-way attack UAV and its Russian-produced variants (Geran-3, Geran-4, Geran-5) as deployed in the Russia-Ukraine conflict through early 2026. It covers the platform's evolution from the Shahed-136, including propulsion (turbojet replacing...
Complete experimental infrastructure supporting:Empirical Validation of Shadow-Price-Guided Inlining in MIR DOI: 10.5281/zenodo.18828679 Source code and analysis scripts for the empirical validation of the compiler-as-NUM (Network Utility Maximization) hypothesis using the MIR lightweight JIT com...
Full experimental validation of dual decomposition protocol for JIT compiler inlining on the MIR lightweight JIT compiler. Implements a three-phase pipeline: Phase 1 synthetic profiling (execution frequencies derived from benchmark structure), Phase 2 shadow-price-guided mutation pass (MIR_CALL &...
A recent formalism recasts the modern compiler as a distributed optimization system, mapping compiler architectures onto decomposition strategies from Network Utility Maximization (NUM). Under this framing, a JIT compiler performing profile-guided optimization implements dual decomposition: a run...
This paper revisits the central claim of Bilar (2007) that the structure of executables is the product of anengineered optimization process. We introduce the Network Utility Maximization (NUM) framework anddemonstrate that modern compiler architectures can be formally mapped onto distinct decompo...
High-performance Thoughtbase for Modern Java (late 2025) Source material: Learning modern Java the playful way by Marit Van Dijk and Piotr Przybył The Modern Java talk by Marit Van Dijk and Piotr Przybył was parsed, and Thoughtbases iteratively constructed; structurally and semantically presented...