What does Formalising Founder Wishes conclude, in numbers, about “Five Slots: Counting Readings, Recording Rulings and Separating the Optative from the Indicative”?

Answer: Chapter 2 breaks wishes into five slots: six fictional wishes have 99 readings, ruling seven vague words books 10.34 bits of loss, and a panel of three readers exposes all the ambiguity in one round with probability only 0.121.

Scope of the numbers: Amounts are in illustrative units with no currency, parameters are illustrative, and all calculations are generated by the book's programs. The book is non-personalised business guidance, not personal financial or investment advice; the psychological literature is reported only as associations with their conditions, and the lower end of an interval is never a promise of income.

中文版

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.121, 10.34

termkbitshid n=1n=2n=3n=5
steady31.581.0000.3800.1600.034
batch31.581.0000.4600.2440.080
glance21.001.0000.5800.3700.170
willing31.581.0000.4200.1900.042
net margin21.001.0000.6800.5200.328
fast31.581.0000.3600.1360.021
annoy42.001.0000.3000.1000.013
bits ruled away if every term is fixed: 10.34
chance a 3-reader panel exposes all seven terms: 0.121
Show the full program
# Chapter 2. p22: auditable ambiguity loss and how many readers find it
# Each vague term has readings with popularity shares (illustrative).
# Ruling a term to one reading discards log2(k) bits of the wish when
# the k readings are counted equally; the ledger records each ruling.
# A panel of n independent readers exposes the ambiguity unless all n
# pick the same reading: P(hidden) = sum of p_i ** n.
import math

TERMS = [
    ("steady", (0.5, 0.3, 0.2)),
    ("batch", (0.6, 0.3, 0.1)),
    ("glance", (0.7, 0.3)),
    ("willing", (0.5, 0.4, 0.1)),
    ("net margin", (0.8, 0.2)),
    ("fast", (0.4, 0.4, 0.2)),
    ("annoy", (0.4, 0.3, 0.2, 0.1)),
]

print("{:<11}{:>4}{:>7}{:>9}{:>9}{:>9}{:>9}".format(
    "term", "k", "bits", "hid n=1", "n=2", "n=3", "n=5"))
bits_all = []
for name, p in TERMS:
    k = len(p)
    bits = math.log2(k)
    bits_all.append(bits)
    hid = [math.fsum(x ** n for x in p) for n in (1, 2, 3, 5)]
    print("{:<11}{:>4}{:>7.2f}{:>9.3f}{:>9.3f}{:>9.3f}{:>9.3f}".format(
        name, k, bits, *hid))
total = math.fsum(bits_all)
print("bits ruled away if every term is fixed: {:.2f}".format(total))
both = 1.0
for _, p in TERMS:
    both *= 1.0 - math.fsum(x ** 3 for x in p)
print("chance a 3-reader panel exposes all seven terms: {:.3f}".format(
    both))

Single source and citation

Fan, Y. (2026). Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation (Version 1.0.0), Chapter 2: Five Slots: Counting Readings, Recording Rulings and Separating the Optative from the Indicative. 5D Library. DOI pending

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

BibTeX
@book{fan2026414,
  author    = {Fan, Yafu},
  title     = {Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book