What does Shared-Input Evidence across Twelve Systems conclude, in numbers, about “The Illusion of "Pointing the Same Way": Spurious Resonance and the Double-Blind Test”?
Answer: Chapter 2 shows that a shared input inflates agreement only when the reader aligns the verdicts: the chance of ten or more agreeing rises to 0.1196, 3.1 times the independent baseline of 0.0385; it also rereads Carlson's double-blind test and Ertel's reanalysis with the book's method.
Scope of the numbers: Its parameters are illustrative, and all calculations are generated by its programs. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.
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.0385, 0.1196, 3.1
| rate of a 1-verdict, by system | |||
| TROP 0.498 SIDR 0.498 MONB 0.502 ZODI 0.500 NSTA 0.565 NAYI 0.400 | |||
| DAYP 0.500 MANS 0.500 WEEK 0.571 TZOL 0.500 LIFE 0.711 HOUR 0.500 | |||
| flipped for alignment: SIDR MONB MANS TZOL | |||
| k | parity rule | aligned | independent |
| 0 | 0.00000 | 0.00141 | 0.00013 |
| 1 | 0.00057 | 0.00954 | 0.00174 |
| 2 | 0.00595 | 0.03317 | 0.01083 |
| 3 | 0.03089 | 0.07353 | 0.04043 |
| 4 | 0.09286 | 0.11488 | 0.10086 |
| 5 | 0.18268 | 0.14497 | 0.17739 |
| 6 | 0.24768 | 0.16279 | 0.22571 |
| 7 | 0.22920 | 0.15859 | 0.20948 |
| 8 | 0.14079 | 0.13135 | 0.14080 |
| 9 | 0.05540 | 0.09434 | 0.06687 |
| 10 | 0.01271 | 0.05362 | 0.02131 |
| 11 | 0.00125 | 0.01903 | 0.00409 |
| 12 | 0.00000 | 0.00278 | 0.00036 |
| parity rule | P(10+ agree) 0.0205, 0.5 times independent; var ratio 0.820 | ||
| aligned | P(10+ agree) 0.1196, 3.1 times independent; var ratio 1.700 | ||
| independent | P(10+ agree) 0.0385 |
Show the full program
# Chapter 2. p21: twelve yes/no verdicts that share one birth moment.
# Each system's verdict is the parity of its label's position (even = 1),
# an illustrative rule that coincides with the alternating polarity of the
# zodiac signs and with yin-yang parity of stems and branches. The count of
# 1-verdicts out of twelve is tallied exactly over the p11 population. The
# "aligned" column flips a verdict when its summed correlation with
# the systems before it is below -0.05 (what reading the charts in
# each other's light does); "independent" keeps the marginal rates.
import datetime
import math
from collections import Counter
D0, D1 = datetime.date(1950, 1, 1), datetime.date(2009, 12, 31)
JIAZI = datetime.date(1949, 10, 1).toordinal() # 甲子日(据通行历表)
GMT, JD = 584283, 1721425 # 卓尔金历 GMT 对应常数;序数日转儒略日
CUM = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334]
# 回归黄道太阳星座起始日(白羊为 0,固定日期近似)
TROP = [(3, 21), (4, 20), (5, 21), (6, 21), (7, 23), (8, 23),
(9, 23), (10, 23), (11, 22), (12, 22), (1, 20), (2, 19)]
# 十二节近似日期,寅月(支序 2)起,子为 0
JIE = [(2, 4), (3, 6), (4, 5), (5, 6), (6, 6), (7, 7), (8, 8), (9, 8),
(10, 8), (11, 7), (12, 7), (1, 6)]
# 六十甲子纳音五行,按每两年一组:M 金 F 火 W 木 E 土 A 水
NAYIN = "MFWEMFAEMWAEFWAMFWEMFAEMWAEFWA"
NAMES = ["TROP", "SIDR", "MONB", "ZODI", "NSTAR", "NAYIN",
"DAYP", "MANS", "WEEK", "TZOL", "LIFE", "HOUR"]
def doy(m, d):
return CUM[m - 1] + min(d, 28 if m == 2 else 31) - 1
def cyc(x, table, first):
best, lab = -1, None
for k, (m, d) in enumerate(table):
s = doy(m, d)
if best < s <= x:
best, lab = s, (first + k) % 12
if lab is None:
s = max(doy(m, d) for m, d in table)
lab = (first + [doy(m, d) for m, d in table].index(s)) % 12
return lab
def digits(n):
return [int(c) for c in str(n)]
def life(d):
s = int(math.fsum(digits(d.year) + digits(d.month) + digits(d.day)))
while s > 9 and s not in (11, 22, 33):
s = int(math.fsum(digits(s)))
return s
def labels(d):
x = doy(d.month, d.day)
n = d.toordinal()
sid = d - datetime.timedelta(days=24) # 恒星黄道:岁差约 24 天
y = d.year if x >= doy(2, 4) else d.year - 1 # 以 2 月 4 日近似立春
return (cyc(x, TROP, 0), cyc(doy(sid.month, sid.day), TROP, 0),
cyc(x, JIE, 2), (y - 4) % 12, (10 - y % 9) % 9 + 1,
NAYIN[((y - 4) % 60) // 2], (n - JIAZI) % 60, (n + 3) % 28,
d.weekday(), (n + JD - GMT + 19) % 20, life(d))
def days():
d = D0
while d <= D1:
yield d
d += datetime.timedelta(days=1) # step
def entropy(counter):
tot = math.fsum(counter.values())
return -math.fsum(c / tot * math.log2(c / tot)
for c in counter.values())
def verdicts(r, hour):
v = [r[0], r[1], r[2], r[3], r[4] - 1,
"MFWEMFAEMWAEFWAMFWEMFAEMWAEFWA".index(r[5]) // 2,
r[6], r[7], r[8], r[9], r[10] - 1, hour]
return [1 - x % 2 for x in v]
def phi(cnt, tot):
p = [cnt[(j, j)] / tot for j in range(12)]
r = [[0.0] * 12 for _ in range(12)]
for i in range(12):
for j in range(12):
cov = cnt[(i, j)] / tot - p[i] * p[j]
r[i][j] = cov / math.sqrt(p[i] * (1 - p[i]) * p[j] * (1 - p[j]))
return p, r
def tally(day_rows, flip):
dist, cnt = Counter(), Counter()
for r in day_rows:
for hr in range(12):
v = [1 - x if f else x for x, f in zip(verdicts(r, hr), flip)]
dist[int(math.fsum(v))] += 1
on = [j for j in range(12) if v[j]]
for i in on:
for j in on:
cnt[(i, j)] += 1
return dist, cnt
day_rows = [labels(d) for d in days()]
tot = len(day_rows) * 12
d0, c0 = tally(day_rows, [0] * 12)
p, r = phi(c0, tot)
flip = [0] * 12
for j in range(1, 12): # 依次定向:与前面已定向者正相关
s = math.fsum((-1 if flip[i] else 1) * r[i][j] for i in range(j))
flip[j] = 1 if s < -0.05 else 0
d1, c1 = tally(day_rows, flip)
ind = [1.0]
for pj in p: # 泊松二项分布:独立而边际相同
new = [0.0] * (len(ind) + 1)
for k, q in enumerate(ind):
new[k] += q * (1 - pj) # step: two terms per cell
new[k + 1] += q * pj # step
ind = new
print("rate of a 1-verdict, by system")
print(" " + " ".join(
"%s %.3f" % (NAMES[j][:4], p[j]) for j in range(6)))
print(" " + " ".join(
"%s %.3f" % (NAMES[j][:4], p[j]) for j in range(6, 12)))
print("flipped for alignment: " + " ".join(NAMES[j] for j in range(12)
if flip[j]))
print(" k parity rule aligned independent")
a0 = [d0[k] / tot for k in range(13)]
a1 = [d1[k] / tot for k in range(13)]
for k in range(13):
print("%2d %13.5f %12.5f %12.5f" % (k, a0[k], a1[k], ind[k]))
def tails(a):
return math.fsum(a[k] for k in range(13) if k >= 10 or k <= 2)
def var(a):
mu = math.fsum(k * a[k] for k in range(13))
return math.fsum((k - mu) ** 2 * a[k] for k in range(13))
vi = math.fsum(q * (1 - q) for q in p)
for name, a in (("parity rule", a0), ("aligned", a1)):
print("%-12s P(10+ agree) %.4f, %.1f times independent; var ratio %.3f"
% (name, tails(a), tails(a) / tails(ind), var(a) / vi))
print("independent P(10+ agree) %.4f" % tails(ind))Single source and citation
Fan, Y. (2026). Down-Weighting Non-Independent Evidence across Twelve Symbolic Systems: Spurious Resonance from a Shared Birth Input and Orthogonal Latent-Variable Synthesis (Version 1.0.0), Chapter 2: The Illusion of "Pointing the Same Way": Spurious Resonance and the Double-Blind Test. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-283 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026283,
author = {Fan, Yafu},
title = {Down-Weighting Non-Independent Evidence across Twelve Symbolic Systems: Spurious Resonance from a Shared Birth Input and Orthogonal Latent-Variable Synthesis},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · One Moment of Birth: the Information of Twelve Systems and Their Mutual-Information Matrix
- Chapter 3 · The Effective Number of Independent Pieces of Evidence: Design Effect, Eigenvalues and Participation Ratio
- Chapter 4 · Bayesian Combination of Correlated Evidence: Down-Weighting the Log-Odds
- Chapter 5 · One Latent Factor, and Orthogonal Synthesis
- Chapter 6 · The Data-Processing Inequality: No Number of Systems Can Exceed the Moment of Birth
- Chapter 7 · Classical Sources East and West: Wang Chong on Day Selection and Cicero On Divination
- Chapter 8 · Closing the Loop: a Down-Weighting Proposal for Synthesis, and Pre-Registered Tests