What does Apparel Graphics at a Distance conclude, in numbers, about “Field Tools and Checker Specifications: A Weekly Long-Range Legibility Ledger and a Pre-Registered Test”?

Answer: Chapter 8 delivers the Apparel Graphic Long-Range Legibility and Exposure Threshold Calculator, checker specifications grouped by kit, a weekly ledger and a pre-registered test for which a single-graphic check needs about 69 anonymous respondents. Boxes separate evidence, runnable Python (22 programs), classical sources and hypotheses.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. Not trademark or copyright advice; graphics are the author's geometric forms, no real brand is named or judged, no subliminal claim is made, and street tests record anonymous answers only, never faces or personal data.

中文版

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: 69

A. per-arm n, two designs at 10 m
0.40 vs 0.55: n =173 per arm,14 sessions
0.45 vs 0.60: n =173 per arm,14 sessions
0.60 vs 0.75: n =152 per arm,13 sessions
0.30 vs 0.50: n =93 per arm,8 sessions
B. exact one-sided test of recognition above a floor
p0 0.50, p1 0.65: n =69, reject at >=42, size 0.0456, power 0.8021
p0 0.30, p1 0.45: n =67, reject at >=27, size 0.0466, power 0.8147
p0 0.20, p1 0.35: n =56, reject at >=17, size 0.0432, power 0.8064
Show the full program
# Chapter 8. p82: how many anonymous answers a street test needs.
# A: two designs at 10 m, recognition p1 vs p2, two-sided alpha 0.05,
#    power 0.80, normal approximation for two proportions.
# B: one design against a pre-registered floor p0 (one-sided exact
#    binomial test, alpha 0.05): smallest n whose exact power at the
#    hoped-for p1 reaches 0.80, found by enumeration.
# C: sessions needed at 25 anonymous answers per session (no faces, no
#    personal data are recorded; only right / wrong per distance).
import math
from statistics import NormalDist

Z = NormalDist()


def n_two(p1, p2, alpha=0.05, power=0.80):
    za, zb = Z.inv_cdf(1 - alpha / 2), Z.inv_cdf(power)
    pb = (p1 + p2) / 2.0
    num = (za * math.sqrt(2 * pb * (1 - pb))
           + zb * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2))) ** 2
    return math.ceil(num / (p1 - p2) ** 2)


def tail(n, k, p):
    terms = [math.comb(n, j) * p ** j * (1 - p) ** (n - j)
             for j in range(k, n + 1)]
    return math.fsum(terms)


def n_exact(p0, p1, alpha=0.05, power=0.80):
    for n in range(10, 2000):
        k = n
        while k > 0 and tail(n, k - 1, p0) <= alpha:
            k -= 1
        if tail(n, k, p1) >= power:
            return n, k, tail(n, k, p0), tail(n, k, p1)
    return None


if __name__ == "__main__":
    print("A. per-arm n, two designs at 10 m")
    for p1, p2 in ((0.40, 0.55), (0.45, 0.60), (0.60, 0.75), (0.30, 0.50)):
        n = n_two(p1, p2)
        print("  {:.2f} vs {:.2f}: n = {:>4} per arm, {:>3} sessions".format(
            p1, p2, n, math.ceil(2 * n / 25)))
    print("B. exact one-sided test of recognition above a floor")
    for p0, p1 in ((0.50, 0.65), (0.30, 0.45), (0.20, 0.35)):
        n, k, a, pw = n_exact(p0, p1)
        print("  p0 {:.2f}, p1 {:.2f}: n = {:>3}, reject at >= {:>3},"
              " size {:.4f}, power {:.4f}".format(p0, p1, n, k, a, pw))

Single source and citation

Fan, Y. (2026). Apparel Graphic Gestalt Capture, Long-Range Contrast Legibility and Streetwear Visual Memetic Retention (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: A Weekly Long-Range Legibility Ledger and a Pre-Registered Test. 5D Library. DOI pending

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

BibTeX
@book{fan2026390,
  author    = {Fan, Yafu},
  title     = {Apparel Graphic Gestalt Capture, Long-Range Contrast Legibility and Streetwear Visual Memetic Retention},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book