Paper v0.3: https://doi.org/10.5281/zenodo.21925896 (concept 10.5281/zenodo.21865793) Software 0.6.1: https://doi.org/10.5281/zenodo.21925901 (concept 10.5281/zenodo.19210120) Table I H1/H2/H3 D_win levels now match data_phase2/phase2_discrimination.csv (200-seed). Do not merge paper PDF and soft...
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...
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...
v1.0.3 — full class bridge formalization Lean spine for the published note (paper v1.0.5): Theorem 3.1: class_bridge / class_bridge' / class_bridge_with_key Corollary 3.2: J_class_invariant (via J_affine_invariant) §5 bad indices: L1_inv_zero, IsBadIndex, bad_index_set Pairwise β-cancel: class_br...
Version 1.0.5: Lean 4 formalization of Theorem 3.1 (class bridge), Corollary 3.2 (class fingerprint invariance), and Section 5 bad-index set; Appendix A.2 correspondence corrected. Exhaustive GF(2^8) checks remain in Python. The Mobius Bridge of Nasr and Carlini removes one guessed key byte from...
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.
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 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...
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 turn-based multipolar crisis simulation for IR research and war studies pedagogy. Models great-power competition across ten domains with eight major actors using stylized, rule-based AI and cascade dynamics.
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...
The contribution is a perspective and a research direction, not a result.We argue that the map from string-theory compactification data to cosmological thermalisation outcome is well-defined as a function but not computable as one. Drawing on the undecidability of spectral gaps (Cubitt, Perez-Gar...
Fan-In Constructal Analysis release v1.0.0 Dual preprint + code release. Paper: https://doi.org/10.5281/zenodo.20313669 Key findings: agentic flattening effect (Gini 0.725 vs 0.882, p=0.0011), FastAPI confound resolved (p=0.0034), log-normal persistence (11/12 repos), longitudinal null. See https...
Import fan-in, the count of intra-repo modules that import a given file, encodes hierarchical coupling structure. By analogy with Constructal flow systems (Bejan 1997), we hypothesize that finite networks shaped by iterative optimization develop log-normal, not power-law, size distributions. We m...
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, doi:10.5281/zenodo.19652725). The parent paper proposes a binding operator B = (S, I, W, rho, chi) unifying coalition formation across five substrates, with recognition-channel pro...
A preprint unifying four documented cases of multi-agent coalition behavior (quantum-game entanglement, evolutionary covert-tag recognition, engineered handshake collusion, and emergent peer-preservation in frontier language models) under a single formal structure: the binding operator $B = (S, I...
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
Synthetic Risk Transfers (SRTs) let banks shed credit risk to non-bank financial intermediaries while keeping the underlying loans on their balance sheets. A structural vulnerability arises when the same banks extend credit lines to the funds that buy their SRT protection, creating a circular lev...
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 technical position paper extends the Autonomous Operations Model (AOM) to Golden Dome boost-phase and terminal-phase hypersonic glide vehicle (HGV) intercept timelines. It makes three contributions. First, it quantifies the combined propagation-delay and ground-station-availability argument...
LatticeOS is not an AI operating system. It is a data ontology enforcement layer with a tasking bus. This technical position note maps LatticeOS (SDK v4.4.0) onto a 4-layer Autonomous Operations Model (AOM) skeleton (cognitive, coordination, control, and governance) and identifies the gap between...
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...