What does Premise Seeding and Zero-Reactance Persuasion conclude, in numbers, about “Timing: Premises Before, At and After the Branch Point”?

Answer: The same true premise works best when it arrives exactly as the reader reaches the branch point. One round early keeps 0.750 of the gain; one round late keeps only 0.550. Where the reader has already declared her position, saying it late costs more than saying it early. When the arrival round is unknown, the best fixed round is one round before the mean arrival; sincere check-in questions add a little more, and hand the reader's own words back to the author.

Scope of the numbers: Parameters are illustrative or synthetic, and all calculations are generated by the book's programs. The book is not psychological counselling, not a guarantee of marketing results and not individual business advice.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.550, 0.750

offset dacceptP(correct branch)gain over none
-30.29530.6124+0.1624
-20.39370.6666+0.2166
-10.52500.7388+0.2888
+00.70000.8350+0.3850
+10.38500.6618+0.2118
+20.21180.5665+0.1165
+30.11650.5141+0.0641
one round early keeps 0.750 of the on-time gain
one round late keeps 0.550 of the on-time gain
Show the full program
# Chapter 3. p31: premise timing relative to arrival at the branch point
# The reader reaches branch point B at round R and chooses the correct
# branch (B -> D) with prior weight W = 0.45 (as in p21). A true premise
# sent d rounds from arrival is accepted with
#   d <= 0 : A0 * M^|d|   (it must be held in memory until B; M = 0.75)
#   d >  0 : the reader already chose; a reader on the wrong branch
#            reverses with A0 * K^d (commitment grows; K = 0.55).
# An accepted premise sent in time makes the choice correct. A0 = 0.70.
# All parameters illustrative.
A0, M, K, W = 0.70, 0.75, 0.55, 0.45


def p_correct(d):
    if d <= 0:
        a = A0 * M ** (-d)
        return a + (1.0 - a) * W
    return W + (1.0 - W) * A0 * K ** d


def accept(d):
    return A0 * M ** (-d) if d <= 0 else A0 * K ** d


print("offset d  accept   P(correct branch)  gain over none")
for d in range(-3, 4):
    pc = p_correct(d)
    print("{:>+8}  {:.4f}  {:>17.4f}  {:>+14.4f}".format(
        d, accept(d), pc, pc - W))
early = p_correct(-1) - W
late = p_correct(1) - W
print("one round early keeps {:.3f} of the on-time gain".format(
    early / (p_correct(0) - W)))
print("one round late keeps {:.3f} of the on-time gain".format(
    late / (p_correct(0) - W)))

Single source and citation

Fan, Y. (2026). Mid-Stream Premise Seeding, Enthymematic Self-Derivation and Zero-Reactance Persuasion Along Reasoning Paths (Version 1.0.0), Chapter 3: Timing: Premises Before, At and After the Branch Point. 5D Library. DOI pending

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

BibTeX
@book{fan2026386,
  author    = {Fan, Yafu},
  title     = {Mid-Stream Premise Seeding, Enthymematic Self-Derivation and Zero-Reactance Persuasion Along Reasoning Paths},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book