Fewer, bigger payments can settle worse than more, smaller ones
There’s a second twist hiding in “simplify.” Netting
doesn’t just cut the number of payments — it changes their
shape. Many small, obvious debts get merged into fewer, larger,
less-obvious ones. Simplification can even route you to pay someone you
never actually transacted with, because the algorithm cares only that
the balances net out, not that the payment makes intuitive sense. (That
legibility cost is its own problem.) But even setting trust aside, a larger
ask is plausibly easier to defer than a small one — a bigger immediate
cost is a more aversive task, and aversive tasks are exactly the ones a
present-biased mind puts off.
Concentration also concentrates risk. Spread across six small
tappable requests, one person flaking costs the group one small share.
Collapsed into two large netted transfers, a single default strands a
big chunk of the total — and the largest transfer is also the easiest
to keep putting off. The count went down; the fragility went up.
It helps to remember what a group check actually is. On splitty’s
own US receipts, the most-ordered line items are individual drinks —
Diet Coke, espresso martinis, water — not shared plates, and nearly half
of group checks top $150. A real bill is a stack of small, individually
owned items, each one recognizable to the person who ordered it. Netting
takes that legible stack and rewrites it as a couple of round numbers nobody
can trace back to a taco or a martini — trading exactly the
recognizability that gets a share paid for a lower transfer count.
~48%of group restaurant checks on splitty’s US receipts top $150 —
and they’re built from many small, individually ordered items (the
most common are drinks). That granular structure is what makes each share
payable, and what “simplify” blurs into a few opaque totals.
Source: splitty first-party receipt data (US-leaning scanned receipts;
shares only, not extrapolated to any population).
What’s optimized Number of transfersWhether transfers happen
Handoff Screenshot / copied text, re-keyed by handPre-filled, tappable request
Timing Whenever, from memoryNow, while the bill is fresh
One person flakes A large netted chunk is strandedOne small share is stranded
Failure mode Optimal on paper, unpaid in lifeA few taps, done
None of this means the fewest-payments math is wrong — it’s
beautiful, and worth knowing. It means the math answers a question that
was already easy (how few transfers could settle this) instead
of the one that’s actually hard (how do we make the transfers
occur).