A living experiment, opened 2026-08-21

Do We Lose the Middle?

Six published aggregate rows sum to 103 participants, but the full-sample curve cannot be reproduced from the licensed material available here. Try one private 15-word report, inspect the exact two-integer payload, and watch an anytime-valid living curve grow.

Loading the historical check and sealed analysis.

Arm B, the living

Fifteen words. One pass.

Press start. A fixed vocabulary appears in one of 60 sealed orders, one word every 600 milliseconds. Then type whatever remains. Scoring is exact and local. Your typed words never leave this browser.

The 60 orders are counterbalanced: four Latin squares, so every word serves every position in exactly four of them, and word difficulty cannot pose as a position effect. Only the first list you complete in a visit can be sent; later lists are practice and stay on this device.

Press start when you are ready.

The volunteer counter

0 arrivals, never a finished sample.

Reading the arm.

Why these intervals: a confidence sequence is valid at every moment simultaneously, including after every visitor refreshes this page. A conventional 1.96-standard-error interval assumes a fixed stopping point. Reusing it under a live counter would quietly spend more false-positive risk at every look.

The 15 position sequences divide a 5% familywise error budget by 15. The two preregistered participant contrasts divide another 5% familywise budget by two, so each contrast's e-process pays alpha 2.5% and its threshold is forty-to-one. The bankroll shows two numbers on purpose: the standing wealth, which can fall back when evidence reverses, and the peak, which is what the threshold rule reads because a Ville crossing is permanent evidence. A peak is never passed off here as the current e-value. Volunteer arrival is not random sampling, so none of this makes the crowd representative.

Arm A, the published record

The table passes. The reproduction gate stays closed.

Murdock reported six between-group conditions, 103 introductory-psychology students in total, and 80 lists per participant across four sessions. The suffix in each condition is seconds per word. The page recomputes the participant total and checks every transcribed aggregate cell against a separately stored printed check.

Murdock 1962, Table 1, page 483. Published aggregates only.
conditionNtranscribed meanprinted checktranscribed SDagreement
sum / weighted arithmeticcomputingcomputingweighted mean is derived here, not printed by the paper

Checking aggregate cells.

Checking the derived total-time regularity.

Comparison gate: checking

The public Penn archive contains 1,200 usable rows per condition, consistent with 15 people doing 80 trials, while the paper reports condition Ns from 15 to 19. The 10-word file carries a 1,201st row holding only the malformed value 0. The README documents 88 as an extra-list intrusion but does not explain observed out-of-range codes 0, 16, 31, 41, and 50. No explicit redistribution license was found. This page therefore ships neither those rows nor a curve derived from them.

Arm C, the machines

The same report format, not the same memory.

A fresh model context receives the same 15 nouns as visible text and is asked to report them, once for each of the 60 counterbalanced orders the living arm deals, so word identity and position are unconfounded for machines too. Every studied token remains available in the model's active context. That is in-context extraction, not human encoding followed by recall. A similar edge shape would not identify a shared mechanism.

Looking for supervisor-supplied raw runs.

The parser applies Unicode NFKC and lowercase, splits only on comma, newline, or semicolon, trims surrounding ASCII punctuation, then exact-matches whole tokens against the order named by each run's protocol id, so a word scores at the position it was shown, not at a canonical position. It gives no fuzzy, stem, semantic, or manual credit. Each raw draw becomes value, refusal, unparseable, or rail error; completions all stay in the position denominator, and rail errors are counted in the open rather than hidden inside it.

The sealed instrument

The analysis had to exist before the crowd.

The literal below is part of this HTML, not recalculated to flatter the current file.

3631e768af9fd774b1a61c0c48a0a3dbc8f6d3f53f01d11e35027075859d1796

Checking the fetched file against the printed hash.

The check

What this page can fail to know.

PUBLISHED ANCHORTable 1 cells, page numbers, and provenance ship in page-data.json. The code checks six condition labels, Ns, means, SDs, the stated total of 103, and recomputes one published relationship from the cells: the total-presentation-time regularity. Aggregate cells are never presented as raw participants, and no participant-level reproduction exists here.
FAILED FULL-SAMPLE GATENo authorized complete participant dataset was available. The unexplained Penn subset cannot reproduce the full published sample. The missing comparison is shown as missing.
PROTOCOL DIFFERENCEThe 1962 study used auditory words, 90-second handwritten recall, 80 lists, and group testing. This page uses one fast visual list, untimed typed report, a fixed vocabulary, and self-selected web volunteers. It is a new analogue, not an exact replication.
FROZEN PAYLOADThe server accepts only recall_mask and list_id. It cannot support the scout's delay randomization, compliance flags, intrusion counts, or one-use nonce. Those planned analyses were removed rather than inferred.
SCORING CHOICEExact normalized whole-word matches count. Fuzzy spelling rescue does not. Duplicate and unmatched counts are shown locally, then discarded. This can undercount misspellings.
ANYTIME VALID, NOT REPRESENTATIVEConfidence sequences permit arbitrary peeking at the running arrivals. They do not turn voluntary, anonymous traffic into a random sample, block determined bots, or repair changes in who visits. The store caps at 25,000 rows; at the cap the page says the arm is closed instead of pretending it still grows.
ONE ATTEMPT, SOFTLYOnly the first completed list in a visit can be sent; later completions are labeled practice and blocked on this device. A reload evades that lock, the frozen two-integer payload cannot record attempt counts, and the server cannot tell a rehearsed volunteer from a fresh one. Practice would inflate recall and reshape the curve.
MODEL IDENTIFICATIONModels see all words in active context. Humans no longer do. The same curve shape cannot prove the same memory mechanism. A perfect 15 of 15 machine report is allowed and would be a flat ceiling, not a failed experiment.
MODEL SCOPEThe request ships the same 60 counterbalanced 15-word orders the living arm deals, one draw per order per census model, at temperature 1. The pooled curve is a mixture across whatever models the census reached, shown per model above it. The proposed 30, 60, 120, and 240-word length ladder still does not ship, so this page does not claim it.
MECHANISMPrimacy and recency do not uniquely prove separate short-term and long-term stores. Inhibition, two-store, temporal-context, and distinctiveness accounts make different commitments. This page estimates a shape, not anatomy.
OPEN QUESTIONSThe Penn subset selection, its out-of-range codes, its reuse license, a complete 103-person dataset, and norms for this 15-word list remained unverified on 2026-08-21.

Sources and audit trail

The record this page leans on.

Murdock, 1962

The primary paper for Table 1, the six conditions, 103 participants, 80-list procedure, and its fitted descriptions.

Penn archive

A public trial archive audited by the scout. It is not redistributed here because completeness and licensing remain unresolved.

Liu et al., 2024

Long-context question answering and key-value retrieval often lost information in the middle. It did not test free recall.

Guo and Vosoughi, 2025

Position effects across language-model classification labels and reordered summarization. Machine serial-position effects are not a novelty claim here.