What does Dream Motifs, Hashed Decks and Coincidence Rates conclude, in numbers, about “The Card as an Action Anchor”?
Answer: In an illustrative model, a daily card followed 80% of the time raises the chance of starting a work block from 0.584 to 0.740, the same as a coin, and less than an if-then plan (0.851). A random pointer is a good rule when the options are nearly equal and a bad one when they differ.
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.584, 0.740, 0.851
| K | free choice | card/coin c=0.5 | c=0.8 | if-then plan |
| 2 | 0.713 | 0.737 | 0.765 | 0.876 |
| 6 | 0.584 | 0.675 | 0.740 | 0.851 |
| 12 | 0.505 | 0.636 | 0.725 | 0.835 |
| K=6, blocks started a week: free 14.6, card 18.5 (+3.9), plan 21.3 |
Show the full program
# Chapter 6. p11: A toy model of action paralysis and the daily card.
# A work block starts with a choice among K similar tasks. Choosing takes
# T = a + b log2(K + 1) minutes (Hick-Hyman form, a = 5, b = 10), and
# every 10 undecided minutes the person drifts off with probability 0.15
# for the rest of the block. Aids: a card (or a coin) names one task and
# is followed with probability c, else the full choice is made after 2
# lost minutes; an if-then plan written the evening before is followed
# with probability 0.8. 25 blocks a week. All parameters illustrative.
# Reference points, not inputs: implementation intentions d = 0.65
# (Gollwitzer and Sheeran); choice overload mean D = 0.02 (Scheibehenne).
import math
A, B, DRIFT = 5.0, 10.0, 0.15
def p_start(k, lost=0.0):
t = A + B * math.log2(k + 1) + lost
return (1 - DRIFT) ** (t / 10)
def with_pointer(k, c):
return c * p_start(1) + (1 - c) * p_start(k, 2.0)
def with_plan(k, adh=0.8):
return adh * (1 - DRIFT) ** (A / 10) + (1 - adh) * p_start(k, 2.0)
if __name__ == "__main__":
print(" K free choice card/coin c=0.5 c=0.8 if-then plan")
for k in (2, 6, 12):
print(" {:2d} {:.3f} {:.3f} {:.3f} "
"{:.3f}".format(k, p_start(k), with_pointer(k, 0.5),
with_pointer(k, 0.8), with_plan(k)))
base = 25 * p_start(6)
card = 25 * with_pointer(6, 0.8)
plan = 25 * with_plan(6)
print(" K=6, blocks started a week: free {:.1f}, card {:.1f} "
"(+{:.1f}), plan {:.1f}".format(base, card, card - base, plan))Single source and citation
Fan, Y. (2026). Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation (Version 1.0.0), Chapter 6: The Card as an Action Anchor. 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 5 · Littlewood's Law and Selective Memory
- 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