| Corpus | World English Bible, public domain, source hash recorded | 66 books · 31,098 verses · 750,390 tokens · 60 books fitted (26,210 verses) · 6 held out (4,888) | — | record The fixed, auditable foundation everything else is scored on. |
| Judge | Is this passage praising or condemning, with verdict words, divine names and function words removed | 51 unread verses (41 blessed, 10 woe): 40 right, 78% (95% CI 65–88%), balanced accuracy 83% · five-fold on 106 fitted-book verses: 79% (CI 71–86%) against a 57% majority | the six unread books, and the fitted books | mixed On the unread books, raw accuracy is below the 80% you get by always answering "blessed". The balanced figure is what the model earns: it catches 9 of the 10 woe verses and 31 of the 41 blessed. The woe side rests on ten verses. The ten highest-weighted words per class are printed; the embedding term is not readable. |
| General value functions | How much of a given signal lies ahead of a state, TD sweeps to convergence | top decile of predicted value sees 2.5–5× the bottom decile's future signal for blessed, death, peace and Jerusalem · 0.9× for woe · rank correlations 0.03–0.11 | 23,736 states in the six unread books | held out weak The ordering holds on unread text, with very little precision. Woe (91 occurrences) fails the decile test. The top-valued states are printed, and some of them look like noise. |
| Alignment prior | Does a corpus-learned sense of value pick the honest option in twelve hand-written grader-hacking scenarios, four options each | with the task logits, at most 1 of 12 · the blessed−woe axis on its own, 6 of 12 (best of three axes tried, n = 12, p ≈ 0.05) | the twelve scenarios · chance 3 of 12 | negative result The earlier build chose the honest option 12 of 12; that came from its 70-concept hand-written lexicon, not from the text, and we withdrew it. The next round pays for human labels and an outside replication. |
| Options and planning | Subtasks from the goal value function, options by value iteration, planning inside the learned model | 0.116 signal per start planned · 0.063 greedy · 0.063 random, over 300 starts | inside the learned model | pipeline The option and planning machinery runs end to end, and plans reach 1.9× the greedy signal inside the model. The score is the model's own, so this is not a held-out result and does not show plans paying off on the text. |
| Symbolic rules | If-then rules extracted from the text, each cited to its verses | 430 rules · 340 antecedents · the ones recurring in more than one book listed | no test yet | inspectable A reader can check any rule against its verses. No predictive test has been applied to them. |
| Transition function | Predicts the next state from the current one, each step scored before it is learned from | top-1 6.1% · 10.1 bits per step | the 60 fitted books, one prequential pass · unigram 10.8 bits · uniform guess 0.09% | pipeline A next-state model on text saves 0.7 bits a step over a unigram, as any sequence model must. This shows the pipeline works, not that a world has been learned. |
| Across languages | Names found separately in the Hebrew, the Greek and two English translations, matched only by which verses they share, then their co-mention partners compared | learned attention agrees 0.63 · 0.50 · 0.66 · plain counting 0.76 · 0.60 · 0.89 · shuffled 0.02 · 0.05 · 0.01 | the whole corpus | consistency check Translations of the same verses give the same co-mention graph, as they must. This shows name detection and alignment work across three scripts with no dictionary, and that counting beats the learned attention. It is not a finding about structure. |