What does Stories, Counter-Arguing and Checkout Bridges conclude, in numbers, about “Field Tools and Checker Specifications: The Story-Page Ledger, a Pre-Registered Test and the Conditions of Refutation”?

Answer: Chapter 8 delivers a story-page ledger, the Narrative Purchase Arc and Checkout Bridge Checker, a checker specification table, a pre-registered test (3,581 visitors per arm for the primary comparison) and the conditions under which the book's claims are refuted. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

Scope of the numbers: Parameters are illustrative, and all calculations are generated by the book's programs. This is general business analysis, not legal or medical advice; every story sample is an illustrative fiction, and no testimonial or real case is fabricated.

中文版

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

visitors per arm, pay rate 0.0105 vs 0.0184: 3,581
visitors per arm, half the lift (0.01445):12,394
visitors per arm, click rate 0.0424 vs 0.0613: 2,160
payments per arm, refund non-inferiority:1,012
visitors per arm to collect them at 0.0184:55,000
weeks at 3,000 visitors per arm per week:19
Show the full program
# Chapter 8. p82: sample size for the pre-registered page test.
# Primary test: pay rate of the story + bridge page versus the story +
# hard cut page, two-sided alpha 0.05, power 0.80, equal arms. Planning
# rates are the illustrative means of p62 (per visitor): hard cut
# 0.0105, bridge 0.0184. We also size the test for half that lift and
# for the click rates, and a one-sided refund non-inferiority test
# (bridge refund share no worse than hard cut by more than 0.03).
import math
from statistics import NormalDist

Z = NormalDist()


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


def n_noninf(p, margin, alpha=0.05, power=0.80):
    za, zb = Z.inv_cdf(1 - alpha), Z.inv_cdf(power)
    return math.ceil((za + zb) ** 2 * 2 * p * (1 - p) / margin ** 2)


if __name__ == "__main__":
    n1 = n_two_prop(0.0105, 0.0184)
    n2 = n_two_prop(0.0105, 0.0105 + (0.0184 - 0.0105) / 2)
    n3 = n_two_prop(0.0424, 0.0613)
    print("visitors per arm, pay rate 0.0105 vs 0.0184: {:,}".format(n1))
    print("visitors per arm, half the lift (0.01445):   {:,}".format(n2))
    print("visitors per arm, click rate 0.0424 vs 0.0613: {:,}".format(n3))
    pays = n_noninf(0.08, 0.03)
    print("payments per arm, refund non-inferiority:    {:,}".format(pays))
    print("visitors per arm to collect them at 0.0184:  {:,}".format(
        math.ceil(pays / 0.0184)))
    print("weeks at 3,000 visitors per arm per week:     {}".format(
        math.ceil(max(n1, pays / 0.0184) / 3000)))

Single source and citation

Fan, Y. (2026). Commercial Storytelling Mechanics, Counter-Arguing Suppression Arcs and Seamless Narrative-to-Checkout Bridges (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: The Story-Page Ledger, a Pre-Registered Test and the Conditions of Refutation. 5D Library. DOI pending

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

BibTeX
@book{fan2026380,
  author    = {Fan, Yafu},
  title     = {Commercial Storytelling Mechanics, Counter-Arguing Suppression Arcs and Seamless Narrative-to-Checkout Bridges},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book