Break Dogma
A dogma is an assumption adopted because someone else does it or someone
asserted it — never because it was measured true here, in this regime. Most
inherited "you must / you can't" survives on authority, not evidence. This skill
is the discipline that separates a real constraint from a cargo-culted one, so we
break the ones blocking the faster/atomic path and keep the ones that are
actually load-bearing.
Breaking dogma is not contrarianism. Some inherited practice is correct, and
reinventing a leaf that isn't the moat is its own dogma (build-don't-reuse). The
goal is calibrated: challenge every assumption, but let the honest ones survive
the test. A dogma broken without a measured reason is just a different dogma.
This skill is the upstream ideation move. What it surfaces feeds:
world-first — a broken dogma is often the incumbent's removed-constraint (the
wall to invent past).
scientific-method — an asserted limit is a falsifiable hypothesis; the probe
kills or confirms it.
herlihy — once you break a serialization/lock dogma, atomicize what it forbade.
The four kinds of dogma
Name which one you are looking at — the test differs.
- Borrowed-runtime dogma — "we need the vLLM/SGLang scheduler / their KV
layout / their launcher." Adopted to save effort. Test: is the borrowed
component the moat, or a leaf? If it is the moat, owning it is the point —
break it. If it is a leaf, reusing it is fine (don't reinvent).
- Borrowed-algorithm dogma — "everyone uses PagedAttention / continuous
batching / symmetric-TP." Test: does the algorithm's payoff regime match
ours? PagedAttention pays at concurrency; at B=1 small-model it is overhead.
A practice optimal in one regime is dogma in another.
- Asserted-limit dogma — "this is compute-bound / bandwidth-capped /
physics-limited / can't beat X." The most dangerous, because it stops the run.
Test: name the single number the limit rests on and MEASURE it. (int4 GEMV
"compute-bound" was actually an occupancy misconfig — 38 blocks on 128 SMs.)
- Our-own legacy dogma — "we already built it this way." Comfort, not
correctness. Test: if a subsystem isn't the purest/fastest atomic form, legacy
comfort is not a reason to keep it.
How dogma hides — it rarely wears a buzzword
A dogma almost never announces itself as "compute-bound." It rides inside
ordinary confident language, in six costumes — this is why the plugin's per-turn
detector fires broadly on claim-shape, not on a keyword list:
- Necessity / impossibility — "needs X", "can't", "only", "always/never".
- Normative — "should", "just use Y", "the right way", "best practice".
- Consensus appeal — "obviously", "everyone knows", "the standard way".
- Bare quantitative/comparative verdict — a number or "faster than Z" with
no measurement cited.
- Borrowed framing — "vLLM does X → we must" (inherited, untested here).
- Your own prior win reused as an axiom — yesterday's result as today's
given.
Any of these is a place an untested premise may ride. False positives are
cheap (a one-line nudge); a miss ships a dogma — so when in doubt, flag it.
The break procedure
Name the dogma as a falsifiable claim. Not "vLLM does X" — "X is necessary
to achieve Y in our regime (B=1, 0.5B, one small GPU)." A dogma you can't state
as a testable sentence is a vibe; sharpen it first. To drag out the hidden
premise behind a confident claim, pick a lens: 5 Whys (chain past the
symptom), inversion (Munger — what would guarantee this is false?),
assumption reversal (negate each premise, ask how you'd achieve the
reversal), pre-mortem (assume it already failed — why?), or "what would
have to be true" (list the conditions the claim requires). Chesterton's
Fence: know why a constraint exists before removing it.
Mine its origin — why does it exist, and for whom? A constraint is only
load-bearing in the regime that created it. Find that regime. Dogma-mining is
the highest-value research move — recipes in references/dogma-mining.md:
gh issues/PRs/comments/won't-fix/RFCs on the incumbents — this is where
they admit the limit and its regime ("by design", "requires symmetric",
"GIL", "won't fix", a load-bearing RFC).
- searxng full surface (
search_many, research, fetch_many) — the
paper/blog that established the practice and the regime it assumed. Cite.
- repomix
pack_remote_repository + grep — read the actual mechanism to
prove the constraint is architectural vs incidental.
- deepwiki
ask_question — targeted "why does X require Y?" on the repo.
Test whether it is load-bearing HERE. Two outcomes:
- Regime-matched → the constraint is real for us too. Keep it (or route the
asserted-limit to
scientific-method for a measured confirm). Honest.
- Regime-mismatched or cargo-culted → the payoff assumed a regime we are not
in. The dogma is breakable. This is the win.
For an asserted-limit dogma, the test is always the cheapest-falsification
probe — one bench/grep/profile that could kill the claim. Never argue a limit
you can measure.
Break it → route to invention. A broken load-bearing constraint is exactly
world-first's removed-constraint test entry: build the structure the
constraint forbade, atomicize it via herlihy, and prove it past a tuned
baseline. Do not stop at "the dogma is false" — the value is what you build in
the space it was guarding.
How we broke it — case log (proof the discipline pays)
Every one of these died to its own number — often a number already in the
ledger — not to argument. This is what "test the assumption" looks like in
practice (source: EXPERIMENTS.md, atomic-inference).
| Assumption (dogma) |
Test |
Verdict |
Evidence |
| "int4 GEMV is compute-bound" |
re-audit occupancy |
BROKE |
46.8 GB/s = ~20× below peak → occupancy misconfig (38 blocks/128 SMs), not a compute wall → gate 46.8→159 GB/s (commit 2a7e911) |
| "single-stream is launch-bound → build a megakernel" |
cudaEvent launch-gap probe |
FALSIFIED (0.9) |
gap only ~14% → DO-NOT-build; one probe beat three council priors |
| "more concurrency = faster per-token" |
our own arithmetic |
FALSIFIED |
418÷32 = 13.1 tok/s/seq vs 149.6 single → ITL rose ~11× |
| "int4 halves bytes → faster" |
event-timed bench |
BROKE |
106.9 vs int8 159.2 tok/s — 33% slower |
| "we're 2.4× faster than baseline" |
fair aggregate-vs-aggregate rematch |
RETRACTED |
was aggregate-vs-single-stream; real = baseline 1.84× faster |
| "spec-decode helps single-stream on 0.5B" |
graph-verify ≈ eager (1.01×) |
FALSIFIED |
verify is compute-bound → DO-NOT-RE-ATTACK |
The lesson: a confident claim is worth exactly the number under it. Some broke,
one held and got logged — both outcomes are wins; only the un-tested premise is
a loss.
The honesty guard (what NOT to break)
- Reuse where it isn't the moat. KISS. A tokenizer, a safetensors loader, a
well-tested leaf — reusing it is not dogma, it is judgment. Breaking it to
"own everything" is itself the build-don't-reuse dogma.
- A surviving dogma is a result. If the mining + probe show the constraint is
real in our regime, say so and keep it. "We tested the assumption and it holds"
is a first-class finding — it stops the next person re-litigating it. Log it.
- Don't break on authority either direction. "Everyone does X" is not a reason
to keep X; "everyone does X so I'll do the opposite" is not a reason to break it.
The only reason is the measured/architectural test.
Cynefin tie (why a dogma stalls a run)
An asserted-limit dogma is usually a Clear or Complicated problem mis-cast as
a Complex wall — the mis-classification is what makes it feel unbreakable.
"int4 is compute-bound" (Complex, give up) was a Clear occupancy heuristic
misconfig. When a limit feels like a wall, re-sense the domain: a wall you can
measure from here is not Complex, it is Clear-wearing-a-costume. Route through
scientific-method's cheapest-falsification-first.
The one-sentence version
State the assumption as a testable sentence, find the regime that made it real,
measure whether that regime is ours — then break the ones that aren't and build
in the space they were guarding, keep the ones that are and log that you checked.
Sources
Kuhn, The Structure of Scientific Revolutions (1962) — anomaly as signal, not
noise. Aristotle, Physics I — reason from primitives, not analogy. Munger/Jacobi
inversion. Feynman, "Cargo Cult Science" (Caltech, 1974) — measurement, not
imitation. Chesterton's Fence — know why before removing. 5 Whys (Ohno/Toyota).
Assumption reversal; Pre-mortem (Klein, HBR 2007). TRIZ. Case log:
EXPERIMENTS.md (atomic-inference), commit 2a7e911.
1---2name: break-dogma3description: Use when an inherited assumption is steering a decision and nobody has checked whether it still holds HERE — "that's how vLLM/SGLang/everyone does it", "you need X to do Y", "this is compute-bound / physics-capped / can't beat Z", "we always do it this way", "best practice is". Triggers on any borrowed runtime/algorithm/protocol adopted by default, any asserted wall or limit, any "must have" that was never measured in our regime, and any "break all dogma / challenge the assumption / why do we even do this" request. The move: name the dogma, mine where it came from and why (competitor issues/PRs/RFCs + searxng + repomix + deepwiki), test whether the constraint is actually load-bearing in OUR regime or cargo-culted from a different one, and if it is not necessary, break it and route to invention. Reach for it by default before adopting any borrowed component or accepting any asserted limit; skip only when the practice is a genuine leaf you are reusing on purpose (KISS).4---56# Break Dogma78A dogma is an assumption adopted because *someone else does it* or *someone9asserted it* — never because it was measured true **here, in this regime.** Most10inherited "you must / you can't" survives on authority, not evidence. This skill11is the discipline that separates a real constraint from a cargo-culted one, so we12break the ones blocking the faster/atomic path and keep the ones that are13actually load-bearing.1415**Breaking dogma is not contrarianism.** Some inherited practice is correct, and16reinventing a leaf that isn't the moat is its own dogma (build-don't-reuse). The17goal is calibrated: challenge every assumption, but let the honest ones survive18the test. A dogma broken without a measured reason is just a different dogma.1920This skill is the **upstream ideation move.** What it surfaces feeds:21- `world-first` — a broken dogma is often the incumbent's removed-constraint (the22 wall to invent past).23- `scientific-method` — an asserted limit is a falsifiable hypothesis; the probe24 kills or confirms it.25- `herlihy` — once you break a serialization/lock dogma, atomicize what it forbade.2627## The four kinds of dogma2829Name which one you are looking at — the test differs.30311. **Borrowed-runtime dogma** — "we need the vLLM/SGLang scheduler / their KV32 layout / their launcher." Adopted to save effort. Test: is the borrowed33 component the *moat*, or a leaf? If it is the moat, owning it is the point —34 break it. If it is a leaf, reusing it is fine (don't reinvent).352. **Borrowed-algorithm dogma** — "everyone uses PagedAttention / continuous36 batching / symmetric-TP." Test: does the algorithm's *payoff regime* match37 ours? PagedAttention pays at concurrency; at B=1 small-model it is overhead.38 A practice optimal in one regime is dogma in another.393. **Asserted-limit dogma** — "this is compute-bound / bandwidth-capped /40 physics-limited / can't beat X." The most dangerous, because it stops the run.41 Test: name the single number the limit rests on and MEASURE it. (int4 GEMV42 "compute-bound" was actually an occupancy misconfig — 38 blocks on 128 SMs.)434. **Our-own legacy dogma** — "we already built it this way." Comfort, not44 correctness. Test: if a subsystem isn't the purest/fastest atomic form, legacy45 comfort is not a reason to keep it.4647## How dogma hides — it rarely wears a buzzword4849A dogma almost never announces itself as "compute-bound." It rides inside50ordinary confident language, in six costumes — this is why the plugin's per-turn51detector fires **broadly** on claim-shape, not on a keyword list:52531. **Necessity / impossibility** — "needs X", "can't", "only", "always/never".542. **Normative** — "should", "just use Y", "the right way", "best practice".553. **Consensus appeal** — "obviously", "everyone knows", "the standard way".564. **Bare quantitative/comparative verdict** — a number or "faster than Z" with57 no measurement cited.585. **Borrowed framing** — "vLLM does X → we must" (inherited, untested here).596. **Your own prior win reused as an axiom** — yesterday's result as today's60 given.6162Any of these is a place an *untested premise* may ride. False positives are63cheap (a one-line nudge); a miss ships a dogma — so when in doubt, flag it.6465## The break procedure66671. **Name the dogma as a falsifiable claim.** Not "vLLM does X" — "X is necessary68 to achieve Y in our regime (B=1, 0.5B, one small GPU)." A dogma you can't state69 as a testable sentence is a vibe; sharpen it first. To drag out the *hidden*70 premise behind a confident claim, pick a lens: **5 Whys** (chain past the71 symptom), **inversion** (Munger — what would guarantee this is false?),72 **assumption reversal** (negate each premise, ask how you'd achieve the73 reversal), **pre-mortem** (assume it already failed — why?), or **"what would74 have to be true"** (list the conditions the claim requires). Chesterton's75 Fence: know *why* a constraint exists before removing it.76772. **Mine its origin — why does it exist, and for whom?** A constraint is only78 load-bearing in the regime that created it. Find that regime. Dogma-mining is79 the highest-value research move — recipes in `references/dogma-mining.md`:80 - **`gh` issues/PRs/comments/won't-fix/RFCs** on the incumbents — this is where81 they *admit* the limit and its regime ("by design", "requires symmetric",82 "GIL", "won't fix", a load-bearing RFC).83 - **searxng** full surface (`search_many`, `research`, `fetch_many`) — the84 paper/blog that established the practice and the regime it assumed. Cite.85 - **repomix** `pack_remote_repository` + `grep` — read the actual mechanism to86 prove the constraint is architectural vs incidental.87 - **deepwiki** `ask_question` — targeted "why does X require Y?" on the repo.88893. **Test whether it is load-bearing HERE.** Two outcomes:90 - **Regime-matched** → the constraint is real for us too. Keep it (or route the91 asserted-limit to `scientific-method` for a measured confirm). Honest.92 - **Regime-mismatched or cargo-culted** → the payoff assumed a regime we are not93 in. The dogma is breakable. This is the win.94 For an asserted-limit dogma, the test is always **the cheapest-falsification95 probe** — one bench/grep/profile that could kill the claim. Never argue a limit96 you can measure.97984. **Break it → route to invention.** A broken load-bearing constraint is exactly99 `world-first`'s removed-constraint test entry: build the structure the100 constraint forbade, atomicize it via `herlihy`, and prove it past a *tuned*101 baseline. Do not stop at "the dogma is false" — the value is what you build in102 the space it was guarding.103104## How we broke it — case log (proof the discipline pays)105106Every one of these died to **its own number** — often a number already in the107ledger — not to argument. This is what "test the assumption" looks like in108practice (source: `EXPERIMENTS.md`, atomic-inference).109110| Assumption (dogma) | Test | Verdict | Evidence |111|---|---|---|---|112| "int4 GEMV is compute-bound" | re-audit occupancy | **BROKE** | 46.8 GB/s = ~20× below peak → occupancy misconfig (38 blocks/128 SMs), not a compute wall → gate 46.8→**159 GB/s** (commit `2a7e911`) |113| "single-stream is launch-bound → build a megakernel" | cudaEvent launch-gap probe | **FALSIFIED** (0.9) | gap only ~14% → DO-NOT-build; one probe beat three council priors |114| "more concurrency = faster per-token" | our own arithmetic | **FALSIFIED** | 418÷32 = 13.1 tok/s/seq vs 149.6 single → ITL *rose* ~11× |115| "int4 halves bytes → faster" | event-timed bench | **BROKE** | 106.9 vs int8 159.2 tok/s — 33% *slower* |116| "we're 2.4× faster than baseline" | fair aggregate-vs-aggregate rematch | **RETRACTED** | was aggregate-vs-single-stream; real = baseline 1.84× faster |117| "spec-decode helps single-stream on 0.5B" | graph-verify ≈ eager (1.01×) | **FALSIFIED** | verify is compute-bound → DO-NOT-RE-ATTACK |118119The lesson: a confident claim is worth exactly the number under it. Some broke,120one *held* and got logged — both outcomes are wins; only the un-tested premise is121a loss.122123## The honesty guard (what NOT to break)124125- **Reuse where it isn't the moat.** KISS. A tokenizer, a safetensors loader, a126 well-tested leaf — reusing it is not dogma, it is judgment. Breaking it to127 "own everything" is itself the build-don't-reuse dogma.128- **A surviving dogma is a result.** If the mining + probe show the constraint is129 real in our regime, say so and keep it. "We tested the assumption and it holds"130 is a first-class finding — it stops the next person re-litigating it. Log it.131- **Don't break on authority either direction.** "Everyone does X" is not a reason132 to keep X; "everyone does X so I'll do the opposite" is not a reason to break it.133 The only reason is the measured/architectural test.134135## Cynefin tie (why a dogma stalls a run)136137An asserted-limit dogma is usually a **Clear or Complicated** problem mis-cast as138a **Complex** wall — the mis-classification is what makes it feel unbreakable.139"int4 is compute-bound" (Complex, give up) was a Clear occupancy heuristic140misconfig. When a limit feels like a wall, re-sense the domain: a wall you can141measure from here is not Complex, it is Clear-wearing-a-costume. Route through142`scientific-method`'s cheapest-falsification-first.143144## The one-sentence version145146State the assumption as a testable sentence, find the regime that made it real,147measure whether that regime is ours — then break the ones that aren't and build148in the space they were guarding, keep the ones that are and log that you checked.149150## Sources151152Kuhn, *The Structure of Scientific Revolutions* (1962) — anomaly as signal, not153noise. Aristotle, *Physics* I — reason from primitives, not analogy. Munger/Jacobi154inversion. Feynman, "Cargo Cult Science" (Caltech, 1974) — measurement, not155imitation. Chesterton's Fence — know why before removing. 5 Whys (Ohno/Toyota).156Assumption reversal; Pre-mortem (Klein, HBR 2007). TRIZ. Case log:157`EXPERIMENTS.md` (atomic-inference), commit `2a7e911`.