What does Dream Motifs, Hashed Decks and Coincidence Rates conclude, in numbers, about “Reverse Dreams, Direct Dreams and Day Residue”?

Answer: Chapter 2 computes the base rates of direct and reverse dreams: accepting both, a dream comes true by chance 0.918 of the time within a week, and a month-long verdict carries 0.000007 bits; day residue meeting a weekly routine makes residues from exactly seven days earlier come true the next day 0.735 of the time.

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.000007, 0.918

window direct only direct or reverse
1 d0.150 0.300
3 d0.386 0.657
7 d0.679 0.918
30 d0.992 1.000
bits a verdict carries (prior 0.5, signal fulfils 0.9):
1-day direct0.482; 30-day direct or reverse: 0.000007
1,000,000 users, chance match 1 in 10,000 per night:
100 striking stories a night, 36,500 a year
P(at least one tonight)1.000000
Show the full program
# Chapter 2. p03: Direct dreams, reverse dreams and the base rate of a
# "dream that came true". A dream is read as good or bad news. Each day a
# notable event happens with probability 0.30, good or bad with equal
# chance, independently of the dream. The interpreter may (a) accept only
# the direct reading, or (b) also the reverse reading ("dreaming of death
# means long life"), and may look for the matching event within k days.
# Also: the expected number of striking matches among a million users.
import math

P_EVENT = 0.30

def p_fulfilled(k, reverse):
    per_day = P_EVENT if reverse else P_EVENT / 2
    return 1 - (1 - per_day) ** k

def p_signal(k, reverse, hit=0.9):
    # a genuine signal is fulfilled with probability `hit` on its own; the
    # same chance events that fulfil any dream can fulfil it too, so the two
    # routes combine independently: 1 - (1 - hit) * (1 - per_day) ** k
    per_day = P_EVENT if reverse else P_EVENT / 2
    return 1 - (1 - hit) * (1 - per_day) ** k

def bits(p_true_if_signal, p_true_if_not):
    # information (bits) a "fulfilled" verdict carries about whether the
    # dream was a real signal, prior 0.5, via mutual information
    p1, p0 = p_true_if_signal, p_true_if_not
    m = (p1 + p0) / 2
    h = lambda q: 0.0 if q in (0.0, 1.0) else \
        -q * math.log2(q) - (1 - q) * math.log2(1 - q)
    return h(m) - (h(p1) + h(p0)) / 2

if __name__ == "__main__":
    print("   window   direct only   direct or reverse")
    for k in (1, 3, 7, 30):
        print("   {:3d} d    {:9.3f}      {:9.3f}".format(
            k, p_fulfilled(k, False), p_fulfilled(k, True)))
    # a genuine signal fulfils itself with probability 0.9, and chance
    # events can fulfil it as well (independent composition, see p_signal)
    print("   bits a verdict carries (prior 0.5, signal fulfils 0.9):")
    print("     1-day direct: {:.3f}; 30-day direct or reverse: {:.6f}"
          .format(bits(p_signal(1, False), p_fulfilled(1, False)),
                  bits(p_signal(30, True), p_fulfilled(30, True))))
    users, p_strike = 1000000, 1e-4
    night = users * p_strike
    print("   1,000,000 users, chance match 1 in 10,000 per night:")
    print("     {:,.0f} striking stories a night, {:,.0f} a year".format(
        night, night * 365))
    print("     P(at least one tonight) = {:.6f}".format(
        1 - (1 - p_strike) ** users))

Single source and citation

Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation (Version 1.0.0), Chapter 2: Reverse Dreams, Direct Dreams and Day Residue. 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