What does Zero Explanation Tax and Artifact Gravity conclude, in numbers, about “Artifacts and Arguments: Costly Signals, the Handicap Principle and Cheap Talk”?

Answer: Chapter 5 compares artifacts with arguments as signals: a receiver judging from 4 verifiable samples reaches an accuracy of 0.770, which takes 66 self-descriptions to match. The gravity model of Chapter 6 shows the 90th and 10th percentiles of ally counts for creators of equal quality differing by a factor of 8.43, with social influence amplifying both inequality and unpredictability.

Scope of the numbers: All parameters are illustrative and all calculations are generated by the book's programs. The book is general business information, not individual advice, psychological counselling or clinical judgement; it makes no promise of income, and rendering an idea means only turning it into a deliverable, verifiable artifact.

中文版

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.770, 66

A. accuracy / matched found / bits, by number of items k
kartifactstalk
10.700 / 0.000 / 0.0560.700 / 0.000 / 0.003
20.735 / 0.490 / 0.1070.700 / 0.000 / 0.007
40.770 / 0.652 / 0.1990.700 / 0.000 / 0.014
80.831 / 0.552 / 0.3480.700 / 0.000 / 0.027
160.907 / 0.825 / 0.5490.704 / 0.185 / 0.053
320.965 / 0.931 / 0.7460.725 / 0.367 / 0.102
B. guessing 'unmatched' for all gives accuracy 0.700
C. talk items needed to match 4 artifacts: 66
Show the full program
# Chapter 5. p53: how well a reader sorts creators from k items.
# Prior share of creators matched to this reader: 0.3. A verifiable
# sample (artifact) looks matched with probability 0.70 if the creator
# is matched and 0.40 if not; a self-description (talk) "sounds matched"
# with probability 0.90 vs 0.85, since anyone can say it. The reader
# applies the Bayes rule to the count of positive items; we compute the
# exact accuracy and the share of matched creators found. Illustrative.
import math

PRIOR = 0.3


def pmf(k, x, p):
    return math.comb(k, x) * p ** x * (1 - p) ** (k - x)


def sort_quality(k, p1, p0):
    acc, found = [], []
    for x in range(k + 1):
        a = PRIOR * pmf(k, x, p1)
        b = (1 - PRIOR) * pmf(k, x, p0)
        if a > b:
            acc.append(a)
            found.append(a)
        else:
            acc.append(b)
    return math.fsum(acc), math.fsum(found) / PRIOR


def bits(k, p1, p0):
    terms = []
    for x in range(k + 1):
        a = PRIOR * pmf(k, x, p1)
        b = (1 - PRIOR) * pmf(k, x, p0)
        px = a + b
        for joint, prior in ((a, PRIOR), (b, 1 - PRIOR)):
            if joint > 0:
                terms.append(joint * math.log2(joint / (px * prior)))
    return math.fsum(terms)


if __name__ == "__main__":
    print("A. accuracy / matched found / bits, by number of items k")
    print("   k     artifacts               talk")
    for k in (1, 2, 4, 8, 16, 32):
        a1, f1 = sort_quality(k, 0.70, 0.40)
        a2, f2 = sort_quality(k, 0.90, 0.85)
        cell = "{:.3f} / {:.3f} / {:.3f}"
        line = "   {:>2}    " + cell + "   " + cell
        print(line.format(k, a1, f1, bits(k, 0.70, 0.40),
                          a2, f2, bits(k, 0.90, 0.85)))
    print("B. guessing 'unmatched' for all gives accuracy {:.3f}".format(
        1 - PRIOR))
    need = next(k for k in range(1, 400)
                if sort_quality(k, 0.90, 0.85)[0] >=
                sort_quality(4, 0.70, 0.40)[0])
    print("C. talk items needed to match 4 artifacts: {}".format(need))

Single source and citation

Fan, Y. (2026). Zero Explanation-Tax Dynamics: Abandoning Validation-Seeking, Full-Power Reality Rendering and Proof-by-Artifact Gravity (Version 1.0.0), Chapter 5: Artifacts and Arguments: Costly Signals, the Handicap Principle and Cheap Talk. 5D Library. DOI pending

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

BibTeX
@book{fan2026432,
  author    = {Fan, Yafu},
  title     = {Zero Explanation-Tax Dynamics: Abandoning Validation-Seeking, Full-Power Reality Rendering and Proof-by-Artifact Gravity},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book