What does Shared-Input Evidence across Twelve Systems conclude, in numbers, about “Classical Sources East and West: Wang Chong on Day Selection and Cicero On Divination”?
Answer: The many day books that Wang Chong criticised all read one stem-branch table. Program p71 shows that five day books together hold only 2.765 bits against 3.141 bits added separately, and no number of day books can exceed 5.907 bits; the share of days marked by at least one book is 0.517, below the independent 0.583, because their marks overlap. Cicero's arguments from twins, from the same moment and from Cannae correspond to "same input, different outcomes" and "same outcome, different inputs": each complete twelve-system profile is shared by about 29,660 people a year, and 100 people meeting one end belong on average to 12.00 signs. The gap in the twins argument is the interval between births, with only a 0.250 chance of different double-hour labels 30 minutes apart, and it needs statistical tests like the time-twins study to close it. The next chapter turns the book's conclusions into a down-weighting procedure that can be followed and a pre-registered test plan.
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.517, 0.583, 2.765, 3.141, 5.907
| book marked share (* = illustrative rule) | |
| bathing | 0.167 |
| writing | 0.100 |
| tailoring* | 0.167 |
| burial* | 0.200 |
| sacrifice* | 0.167 |
| days marked by at least one book | 0.517 (independent books: 0.583) |
| pairwise phi among the books | |
| bathing tailoring* | -0.200 |
| bathing sacrifice* +0.400 | |
| writing tailoring* +0.149 | |
| writing burial* | -0.167 |
| writing sacrifice* +0.149 | |
| tailoring* burial* +0.224 | |
| tailoring* sacrifice* | -0.200 |
| burial* sacrifice* +0.224 | |
| joint entropy of five verdicts 2.765 bits; sum of parts 3.141 | |
| ceiling for any stack of day books: log2 60 | 5.907 bits |
Show the full program
# Chapter 7. p71: Wang Chong's day books all read one input, the day's
# stem-branch in the sixty-day cycle. Rules: the bathing book marks zi and
# mao days (as Wang Chong quotes it); the writing taboo marks bing days
# (as he reports it); the tailoring, burial and sacrifice rules below are
# ILLUSTRATIVE stand-ins, not reconstructions of lost texts. Exact over
# one sixty-day cycle (every day of it equally likely).
import math
from collections import Counter
STEM_BING = 2 # 丙
BOOKS = [("bathing", "branch", {0, 3}), # 子、卯:据《讥日》所引沐书
("writing", "stem", {STEM_BING}), # 丙日:据《讥日》所述
("tailoring*", "branch", {2, 8}), # 示意
("burial*", "stem", {0, 6}), # 示意
("sacrifice*", "branch", {0, 6})] # 示意
def marks(i):
stem, branch = i % 10, i % 12
return tuple(1 if (stem if kind == "stem" else branch) in s else 0
for _, kind, s in BOOKS)
def h(c):
t = math.fsum(c.values())
return -math.fsum(v / t * math.log2(v / t) for v in c.values())
rows = [marks(i) for i in range(60)]
k = len(BOOKS)
p = [math.fsum(r[j] for r in rows) / 60 for j in range(k)]
print("book marked share (* = illustrative rule)")
for (name, _, _), q in zip(BOOKS, p):
print(" %-11s %8.3f" % (name, q))
union = len([r for r in rows if any(r)]) / 60
indep = 1 - math.prod(1 - q for q in p)
print("days marked by at least one book: %.3f (independent books: %.3f)"
% (union, indep))
print("pairwise phi among the books")
for a in range(k):
for b in range(a + 1, k):
pab = len([r for r in rows if r[a] and r[b]]) / 60
ph = (pab - p[a] * p[b]) / math.sqrt(
p[a] * (1 - p[a]) * p[b] * (1 - p[b]))
if abs(ph) > 1e-9:
print(" %-11s %-11s %+.3f" % (BOOKS[a][0], BOOKS[b][0], ph))
hj = h(Counter(rows))
hs = math.fsum(h(Counter(r[j] for r in rows)) for j in range(k))
print("joint entropy of five verdicts %.3f bits; sum of parts %.3f"
% (hj, hs))
print("ceiling for any stack of day books: log2 60 = %.3f bits"
% math.log2(60))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 7: Classical Sources East and West: Wang Chong on Day Selection and Cicero On Divination. 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 2 · The Illusion of "Pointing the Same Way": Spurious Resonance and the Double-Blind Test
- 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 8 · Closing the Loop: a Down-Weighting Proposal for Synthesis, and Pre-Registered Tests