What does Dream Motifs, Hashed Decks and Coincidence Rates conclude, in numbers, about “Avalanche, Collisions and How Unique a Reading Is”?
Answer: Chapter 4 shows that one changed character gives a new reading, and that 455 users have an even chance of sharing a three-card spread.
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: 455
| one card N | 54: 50% repeat at n = 9 (8.652) |
| 3-card spread N | 1.488e+05: 50% repeat at n = 455 (454.2) |
| 7-day path N | 1.339e+12: 50% repeat at n = 1,362,405 (1.362e+06) |
| full order N | 2.308e+71: 50% repeat at n = - (5.657e+35) |
| 10,000 users in a day: expected pairs with the same spread 335.9 | |
| chance a given user shares the spread with someone | 0.065 |
Show the full program
# Chapter 4. p08: Birthday bounds - how unique is "your" reading?
# For N equally likely readings, the smallest number of users n with a
# 50% chance that two of them get the same one is found exactly from
# P(no repeat) = prod (1 - i/N); the approximation sqrt(2 N ln 2) is in
# brackets.
# Readings: one card (54), a three-card spread (148,824), a 7-day path
# of one card a day drawn with replacement (54**7), the full order (54!).
# Also: expected pairs sharing a spread among 10,000 users in one day.
import math
def n50(N, cap=5000000):
p, n = 1.0, 1
while n < cap:
p *= 1 - n / N
n += 1
if p <= 0.5:
return n
return None
if __name__ == "__main__":
cases = (("one card", 54), ("3-card spread", 54 * 53 * 52),
("7-day path", 54 ** 7), ("full order", math.factorial(54)))
for name, N in cases:
approx = math.sqrt(2 * N * math.log(2))
exact = n50(N) if N < 10 ** 13 else None
print(" {:13s} N = {:.4g}: 50% repeat at n = {} ({:.4g})"
.format(name, N, "{:,}".format(exact) if exact else "-",
approx))
users = 10000
pairs = users * (users - 1) / 2 / 148824
print(" 10,000 users in a day: expected pairs with the same spread "
"{:.1f}".format(pairs))
share = 1 - (1 - 1 / 148824) ** (users - 1)
print(" chance a given user shares the spread with someone: {:.3f}"
.format(share))Single source and citation
Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation (Version 1.0.0), Chapter 4: Avalanche, Collisions and How Unique a Reading Is. 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 5 · Littlewood's Law and Selective Memory
- 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