Multiplication of Binaries
also Multiplying pass/fail factors · AND-combination of factors · Binary factor multiplication
Combining many pass/fail factors by multiplying their 1s and 0s, so a single zero on any necessary factor fails the whole option.
Multiplication of binaries is CF’s proposed solution to a hard math problem: how to combine many factors from different dimensions into one overall evaluation. Temple argues that the usual move — scoring each factor, weighting it, and adding the results — is mathematically broken. You cannot add unlike terms (3 acres + 8 hours + 5 grams does not simplify), so additive weighted-factor and pro/con methods secretly invent arbitrary conversions of every dimension into a made-up “goodness” unit, which has no measurable meaning.
Multiplication, unlike addition, can combine different dimensions into a single term — but for general numeric factors it yields useless multi-dimensional units (gram-second-meter-dollars). The fix has two parts. First, convert each non-binary factor into a binary one by asking a yes/no question — chiefly “is it good enough for my goal?” Second, multiply those 1s and 0s. Because multiplying binaries equals logical AND, the result is 1 (pass) only if every factor passes; one 0 fails the whole option and no quantity of 1s can compensate. The factors are sub-goals; the product is the overall goal.
This is the math behind CF’s yes-or-no philosophy: a passing option has no decisive criticism and is non-refuted. It opposes maximizing (optimize every detail) in favor of satisficing, giving resilient conclusions where small data changes do not flip the verdict. The rejection of argument weighting is specifically CF’s, extending beyond CR: CR rejects only positive (justifying) arguments yet still treats arguments as having degrees of strength and uses weighted sums, whereas CF rejects strong-vs-weak argument weighing outright. The approach also draws on ToC’s insight that most factors have excess capacity, so only breakpoints matter.