Andrew Fribush

fig. 2.16.3: eight illustrative rows from two observers of one session under three matching rules

fig. 2.16.3 · eight illustrative rows from two observers of one session under three matching rules.
EXACT IDS PROVE TWO TWINS AND INVENT NONEEXACT ID · 2 PROVEN, 0 WRONGSIZE WITHIN 2% · 2 CORRECT, 2 WRONGDROP THE HARVESTER · 2 REAL CALLS LOSTONE ROW IS ONE TELEMETRY ROW; A LINK JOINS ROWS RULED ONE CALL.OBSERVERIDSIN→OUT#1PROXYmsg_01A1,200→340COUNTS · #2 MERGED IN#2HARVESTERreq_7f2 msg_01A1,200→340SAME CALL AS #1 · PROVEN BY MSG_01A#3PROXYmsg_02B1,210→338COUNTS · #4 MERGED IN#4HARVESTERreq_9c4 msg_02B1,210→338SAME CALL AS #3 · PROVEN BY MSG_02B#5PROXYmsg_03C1,195→342ITS OWN CALL#6HARVESTERreq_1d84,020→90ITS OWN CALL#7HARVESTERreq_5e0 msg_04D1,205→336ITS OWN CALL#8PROXYmsg_05E4,020→90ITS OWN CALLIN PRODUCTION THE EXACT RULE PROVED 4,327 PAIRS, THEN 173,280 ONE-TO-ONE TWINS;THE PATH CUT HAD HIDDEN 28,371 ROWS THAT WERE A CALL’S ONLY COPY.

Eight illustrative rows; the ground truth is that 1 and 2 are one call, 3 and 4 another, and 5 to 8 are four calls each seen once.

source: illustrative rows (synthetic, the mechanism only); which rule is right is from tokenpylon docs/telemetry-repair.md:5,11 and docs/public-totals-repair-2026-09-23.md:25 · twinMatcher.data.ts

View in context: One call, two ids → · All figures

Andrew Fribush, software and computer engineer in Austin. I build consequential systems where software meets institutions: finance, healthcare, commerce, government data, and the mechanisms that govern AI agents. Taking new engagements: hello@andrewfribush.com.