What does Zi Wei Archetypes and Monetization conclude, in numbers, about “Practice: Reading a Sample Chart, and a Blind-Matching Protocol”?

Answer: Chapter 8 demonstrates the look-up on a sample chart that contains no birth data and gives a pre-registered blind-matching protocol: with three choices and a true hit rate of 0.40, it needs 325 people. Marked boxes separate published evidence, runnable Python calculations, classical sources and the author's hypotheses.

Scope of the numbers: All calculations are generated by the programs printed in the book; it is not investment, career, psychological or marital advice. Marked boxes separate published evidence, runnable Python calculations, 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.40, 325

kchancetrue hitN exactN normalN exact (2 ends)
30.33330.40325318415
30.33330.45111105139
30.33330.50585268
60.16670.25148138182
60.16670.30625780
N = 100, k = 3: reject if hits >= 42; false-positive rate 0.0434
Show the full program
# Chapter 8. p09: How many people a blind matching test needs. Each
# participant sees k anonymised readings - one written from their own
# chart's archetype entry, k - 1 decoys drawn from other families - and
# picks the one that fits. If the readings carry no chart-specific
# information (pure Barnum text), the hit rate is 1/k. We test one-sided
# with the exact binomial at alpha 0.05 (and 0.025 when the self card
# and the money card are two primary endpoints) and find the smallest N
# whose exact power reaches 0.80 for a true hit rate p1. Exact sums of
# binomial terms in logs; the scan starts below the normal-theory N.
from math import exp, lgamma, log, ceil, sqrt
from statistics import NormalDist

def tail(n, c, p):
    """P(X >= c) for X ~ Binomial(n, p)."""
    lp, lq = log(p), log(1 - p)
    return sum(exp(lgamma(n + 1) - lgamma(x + 1) - lgamma(n - x + 1)
                   + x * lp + (n - x) * lq) for x in range(c, n + 1))

def power(n, p0, p1, alpha):
    c = int(n * p0)
    while tail(n, c, p0) > alpha:
        c += 1
    return tail(n, c, p1), c

def n_needed(p0, p1, alpha):
    z = NormalDist().inv_cdf
    na = ((z(1 - alpha) * sqrt(p0 * (1 - p0)) + z(0.80) *
           sqrt(p1 * (1 - p1))) / (p1 - p0)) ** 2
    n = max(10, int(0.8 * na))
    while power(n, p0, p1, alpha)[0] < 0.80:
        n += 1
    return n, ceil(na)

if __name__ == "__main__":
    print("   k   chance   true hit   N exact   N normal   N exact (2 ends)")
    for k, p1 in ((3, 0.40), (3, 0.45), (3, 0.50), (6, 0.25), (6, 0.30)):
        p0 = 1 / k
        n1, na = n_needed(p0, p1, 0.05)
        n2, _ = n_needed(p0, p1, 0.025)
        print("   {}   {:.4f}   {:.2f}       {:>7}   {:>8}   {:>8}".format(
            k, p0, p1, n1, na, n2))
    pw, c = power(100, 1 / 3, 1 / 3, 0.05)
    print("   N = 100, k = 3: reject if hits >= {}; false-positive rate"
          " {:.4f}".format(c, pw))

Single source and citation

Fan, Y. (2026). The Zi Wei Holographic Personality and Monetization Atlas (Version 1.0.0), Chapter 8: Practice: Reading a Sample Chart, and a Blind-Matching Protocol. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-116 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026116,
  author    = {Fan, Yafu},
  title     = {The Zi Wei Holographic Personality and Monetization Atlas},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book