5D Library › Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation · 中文
Chapter 5. Littlewood’s Law and Selective Memory
A card a day and the events of the day
Suppose a user draws one “action card” each morning, say an image of a door, and over the next 24 hours meets small events: messages, encounters, things overheard. Each event “fits” the card’s image with some small probability , independently of the card. The chance of at least one fit in a day is , very close to the Poisson form . The mathematician J. E. Littlewood made the same count for “miracles”: if a person notices about one event per second for eight waking hours, a one-in-a-million event should happen to an ordinary person roughly once a month (Littlewood 1953); Freeman Dyson later called this Littlewood’s law (Dyson 2004). Diaconis and Mosteller set out the general method: count the opportunities before marvelling at the match (Diaconis and Mosteller 1989).
Calculation
# Chapter 5. p09: Littlewood's law and the daily card. A card is drawn
# in the morning; over the next 24 hours the user meets M small events,
# each of which "fits the card's image" with probability q, independent
# of the card. P(at least one fit) = 1 - (1 - q)**M, close to the
# Poisson form 1 - exp(-qM). A three-card spread gives each event three
# chances. Littlewood's count: one event a second for 8 waking hours.
import math
def p_fit(q, M, cards=1):
q3 = 1 - (1 - q) ** cards
return 1 - (1 - q3) ** M
if __name__ == "__main__":
qs = (0.005, 0.01, 0.02, 0.05)
print(" P(at least one fit in a day), one card")
print((" M " + "".join(" q={:<6}".format(q) for q in qs))
.rstrip())
for M in (20, 50, 100, 200):
print(" {:4d} ".format(M) +
"".join(" {:8.3f}".format(p_fit(q, M)) for q in qs))
print(" Poisson form at q=0.01, M=50: {:.3f}".format(
1 - math.exp(-0.5)))
print(" three-card spread, q=0.01, M=50: {:.3f}".format(
p_fit(0.01, 50, 3)))
print(" days in a 30-day month with no fit at q=0.01, M=50: {:.1f}"
.format(30 * (1 - p_fit(0.01, 50))))
per_day = 8 * 3600
print(" Littlewood: {:,} events a day;".format(per_day))
print(" a one-in-a-million event every {:.1f} days".format(
1e6 / per_day))
# P(at least one fit in a day), one card
# M q=0.005 q=0.01 q=0.02 q=0.05
# 20 0.095 0.182 0.332 0.642
# 50 0.222 0.395 0.636 0.923
# 100 0.394 0.634 0.867 0.994
# 200 0.633 0.866 0.982 1.000
# Poisson form at q=0.01, M=50: 0.393
# three-card spread, q=0.01, M=50: 0.779
# days in a 30-day month with no fit at q=0.01, M=50: 18.2
# Littlewood: 28,800 events a day;
# a one-in-a-million event every 34.7 daysWith and , a single card fits at least one event on 0.395 of days (Poisson form 0.393); with , 0.636; with 200 events and , 1.000. A three-card spread gives every event three chances and raises 0.395 to 0.779. Even at and , a 30-day month still has about 18.2 days with no fit. Littlewood’s count gives 28,800 events a day and a one-in-a-million event every 34.7 days.
Selective memory: from 40% to “it always works”
People remember the days a card fitted better than the days it did not. Suppose a fitting day is remembered with probability 0.90 and a non-fitting day with probability 0.20.
Calculation
# 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))
# 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.395A true hit rate of 0.395 is remembered as 0.746, and 0.636 as 0.887. Simulating 10,000 users for 30 days without a diary, the median remembered rate is 0.750, and 0.671 of users remember the card working on at least 70% of days. A diary written every evening, recording fit or no fit before memory can sort the days, recovers the true 0.395.
Hypothesis · not established
The author’s interpretation (not yet tested): users who keep a daily fit/no-fit diary for four weeks report a lower felt accuracy of the daily card than users who do not, while their reported help with starting work does not fall. What would show it wrong: diary keepers’ felt accuracy is not lower, or their reported help with starting work falls as much as their felt accuracy.
Summary
With 50 small events a day and a one-in-a-hundred chance that each fits, a daily card “comes true” on 0.395 of days by chance alone, and a three-card spread on 0.779. Remembering hits better than misses turns 0.395 into 0.746. A daily diary is the cheapest correction.
References
Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation: REM Semantic Spreading, SHA-256 Fisher-Yates Permutations and Retroactive Coincidence Rates [梦境意象二分图、确定性哈希牌卡与潜意识先验激活] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090233 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).