What does Dream Motifs, Hashed Decks and Coincidence Rates conclude, in numbers, about “Littlewood's Law and Selective Memory”?
Answer: Chapter 5 counts by Littlewood's law: a daily card fits at least one event on 0.395 of days by chance, and selective memory turns this into 0.746. In Chapter 6 an illustrative model shows that a card helps with action paralysis (the chance of starting work rises from 0.584 to 0.740) exactly as much as a coin, and less than an if-then plan.
Scope of the numbers: It does not claim that dreams or cards foretell anything; the motif graph, event rates, memory rates and behavioural parameters are illustrative or synthetic; all data are generated by its programs; the book is not medical or psychological advice. In Chapter 6 an illustrative model shows that a card helps with action paralysis (the chance of starting work rises from 0.584 to 0.740) exactly as much as a coin, and less than an if-then plan.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.395, 0.746
q=0.01: true hit rate 0.395, remembered 0.746
q=0.02: true hit rate 0.636, remembered 0.887
30 days, no diary: median remembered rate 0.750; 0.671 of users
remember it working on at least 70% of days
with a daily diary the recorded rate is the true 0.395Show the full program
# Chapter 5. p10: Selective memory turns a 40% hit rate into "it works".
# Days on which the card fitted an event are remembered with probability
# 0.90, days on which it did not with probability 0.20. The remembered
# hit rate is r = 0.9 p / (0.9 p + 0.2 (1 - p)), with p from p09
# (q = 0.01 and 0.02, M = 50). 10,000 simulated users keep no diary for
# 30 days (seed 89); a diary written every evening removes the bias.
import random
def remembered(p, a=0.90, b=0.20):
return a * p / (a * p + b * (1 - p))
def p_fit(q, M):
return 1 - (1 - q) ** M
if __name__ == "__main__":
for q in (0.01, 0.02):
p = p_fit(q, 50)
print(" q={:.2f}: true hit rate {:.3f}, remembered {:.3f}".format(
q, p, remembered(p)))
rng = random.Random(89)
p = p_fit(0.01, 50)
rates, sure = [], 0
for _ in range(10000):
hit = miss = 0
for _ in range(30):
if rng.random() < p:
hit += rng.random() < 0.90
else:
miss += rng.random() < 0.20
r = hit / (hit + miss) if hit + miss else 0.0
rates.append(r)
sure += r >= 0.70
rates.sort()
print(" 30 days, no diary: median remembered rate {:.3f}; "
"{:.3f} of users".format(rates[5000], sure / 10000))
print(" remember it working on at least 70% of days")
print(" with a daily diary the recorded rate is the true {:.3f}"
.format(p))Single source and citation
Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation (Version 1.0.0), Chapter 5: Littlewood's Law and Selective Memory. 5D Library. https://doi.org/10.5281/zenodo.24090233
DOI: 10.5281/zenodo.24090233 · Read the monograph · 5DL-B-089 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026089,
author = {Fan, Yafu},
title = {Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090233},
url = {https://doi.org/10.5281/zenodo.24090233}
}Other chapter answers in this book
- Chapter 1 · Dream Motifs as a Bipartite Graph, and Spreading Activation in REM Sleep
- Chapter 2 · Reverse Dreams, Direct Dreams and Day Residue
- Chapter 3 · A Deterministic 54-Card Deck: SHA-256 and the Fisher-Yates Shuffle
- Chapter 4 · Avalanche, Collisions and How Unique a Reading Is
- Chapter 6 · The Card as an Action Anchor
- Chapter 7 · The Six Dreams of the Rites of Zhou, Wang Fu's Ten Kinds of Dream, the Dunhuang Dream Book and Jung's Synchronicity
- Chapter 8 · Auditing a Card App and a Pre-Registered Trial