Skip to content

Instantly share code, notes, and snippets.

View bigsnarfdude's full-sized avatar
πŸ’­
I may be slow to respond.

BigsnarfDude bigsnarfdude

πŸ’­
I may be slow to respond.
View GitHub Profile
  1. The specificity ratio ("51Γ—/617Γ—") β€” May. Method: intervene along a candidate direction at a layer (ablate or boost it in the residual stream), then compute the ratio |Ξ”p_clinical under EMERGENCY| / |Ξ”p under TRANSIT|; a ratio β‰₯5Γ— was read as "authority-specific." Outcome: retired as a division-by-noise artifact. The transit denominator sits at the hardware's numerical precision floor β€” the same experiment gave 26Γ— on a GH200 and 617Γ— on nigel purely from float precision differences (L34_RATIO_DIAGNOSTIC_2026-05-09.md). The base/SFT cells also had no behavioral dynamic range at all (~0.53 under both prompts, nothing to move).

  2. d_auth β€” the diff-of-means direction β€” June. Method: mean last-token residual under EMERGENCY minus

---
name: verify-frontend-change
description: Verify any UI change end-to-end before declaring it done.
---
# Verifying frontend changes
Never report a UI change as complete based on a successful edit alone. Verify it the way a human reviewer would:
1. Start the dev server and open the edited page in the browser.
@bigsnarfdude
bigsnarfdude / gist:3cc89d8a088881980762ece0080711cf
Created June 24, 2026 17:08
lit review for RL install circuits

Novelty Assessment: Geometry of an Installed Trait Across SFT vs DPO vs GRPO

TL;DR

  • The headline finding is genuinely novel as a specific measured comparison, but novel-but-incremental as a phenomenon. No published work installs a single behavioral trait via SFT, DPO, and GRPO and then compares its effective dimensionality / participation ratio in the residual stream via causal top-k SVD ablation at matched behavioral magnitude. The component ideas (linear trait directions, low intrinsic dimensionality of fine-tuning, DPO "bypass" mechanism, RL entrenchment) are all individually published.
  • One prior result partially CONTRADICTS the direction of the finding: Li et al. 2025 ("Tracing the Representation Geometry...") classify both SFT and DPO as rank-expanding ("entropy-seeking") and only RLVR as rank-compressing β€” the opposite ordering to "DPO more concentrated than SFT." This must be pre-empted, though their measurement is global last-token geometry (RankMe/Ξ±ReQ), not a single installe
@bigsnarfdude
bigsnarfdude / CircuitPlasticity.md
Last active June 20, 2026 16:29
Circuit plasticity

Circuit plasticity

Why post-training alignment is always fighting geometry that was set earlier β€” and what to do about it.

don't police the prompt β€” pour the defense into the substrate while it's still plastic, and use the mechanism to prove it set.

continuum Β· 2026-06-18 Β· program note (Step-0 + Ξ±-sweep in)

If behavioral circuits are plastic early and rigid late, then the smart place to install a disposition (honesty, a defense) is during the plastic window β€” as load-bearing substrate β€” not bolted on at the end where it's a removable knob. We're building a pipeline to find which documents write which dispositions β€” but the first controlled test came back negative: the document-built directions don't beat a random vector, so the cheap readout (as built) doesn't capture the target. Only d_auth itself is direction-specific.

If behavioral circuits are plastic early and rigid late, then the smart place to install a disposition (honesty, a defense) is during the plastic window β€” as load-bearing substrate β€” not bolted on at the end where it's a removable knob. We're building a pipeline to find which documents write which dispositions, and I'm running an experiment now to see if the idea holds on my model.

@bigsnarfdude
bigsnarfdude / gist:f0e2ad4a6c506c52ea059df87f34ed53
Last active June 5, 2026 22:28
ErdΕ‘s Problem #741(ii)

This text is an executive summary of an empirical AI research experiment (dated June 4–5, 2026). It evaluates how effectively different Large Language Models can write formal mathematical proofs in Lean 4 (a interactive theorem prover and programming language).

The experimenters used a newly formalized, historically significant mathematical theoremβ€”ErdΕ‘s Problem #741(ii)β€”as a diagnostic "yardstick" to test the boundaries of AI code generation, translation, and reasoning.

Below is a breakdown of the mathematical context, the experiment's design, and the key findings.


1. The Mathematical Context: ErdΕ‘s Problem #741(ii)

  • What is the problem? Originally posed by mathematician Paul ErdΕ‘s, this combinatorics problem asks if there exists an "efficient and unsplittable" subset $A$ of natural numbers.

A History of Modern AI Firms β€” Fact Check & Annotated Report

Verdict on the original claims: mostly true, with two important corrections and several nuances.

This report verifies each claim in the original narrative against primary and secondary sources, flags errors, and adds documentary context. Sources include court testimony from Musk v. Altman (2026), Walter Isaacson's Elon Musk biography, Sebastian Mallaby's The Infinity Machine: Demis Hassabis, DeepMind and the Quest for Superintelligence, Cade Metz's Genius Makers, and direct interviews given by the principals.


1. Hassabis pitches Thiel via chess β€” TRUE

@bigsnarfdude
bigsnarfdude / solver.txt
Created May 25, 2026 21:23
rrma erdos solver
From Table 1 of the paper. Here they are ranked by how well they fit the current RRMA setup:
---
Cluster 1 β€” Density (reuse #125 infrastructure directly)
β”Œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”
β”‚ # β”‚ Year β”‚ Statement β”‚ Technique β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚ 125 β”‚ 1996 β”‚ lowerDensity(A+B) = 0 for base-3/4 digit sets β”‚ Dirichlet + inductive thinning ← β”‚
β”‚ β”‚ β”‚ β”‚ running β”‚
  1. Treat simulators as the object of study, not the tool. Mech interp methodology applied to mechanistic simulators is almost completely unexplored, and it's a natural fit. Each simulator (CorticalSim, Cytosim, Tubulaton) makes different assumptions and produces different array behaviors. The mech interp move: don't just compare their outputs to data β€” intervene inside them. Ablate the collision rule and see what global statistic changes. Patch the dynamic instability module from Tubulaton into Cytosim and see if it rescues a phenotype. Treat each model as a circuit and ask which subcircuits are doing the work. This is exactly activation patching, just on a hand-built mechanistic model instead of a learned one. I don't think the plant MT community has framed it this way and the framing alone would be useful.
  2. Learned surrogates of the simulators. Cytosim takes hours to run; you can't easily do MCMC over its parameters or run gradient-based optimization. Train a neural surrogate that maps (parameters, initia

Beyond the Black Box: Why Clean Fine-Tuning Rotates LLM Vulnerabilities Instead of Curing Them

In the rapidly evolving world of mechanistic interpretability, a central debate has emerged: Are language model capabilities localized to a single, privileged computational pathway, or are they densely distributed across a compositional landscape of competing mechanisms?

Two fascinating pieces of work from May 2026 bring this theoretical debate into sharp, high-stakes focusβ€”especially concerning model safety and clinical reliability.