aboutsummaryrefslogtreecommitdiffstats
path: root/docs/research/092-tpcc.md
diff options
context:
space:
mode:
authoreunhhu <[email protected]>2026-09-29 15:17:40 +0100
committereunhhu <[email protected]>2026-09-29 15:17:40 +0100
commit7ad006f6f2d52c105ce6767d34fbd8a7abed4012 (patch)
tree65597b55e38bafbc326df5a84fb9b8174b44f14f /docs/research/092-tpcc.md
parent088f85ed72b61e879964a4cba6a0c0faa135facb (diff)
downloadpure-7ad006f6f2d52c105ce6767d34fbd8a7abed4012.tar.gz
pure-7ad006f6f2d52c105ce6767d34fbd8a7abed4012.zip
Say that a receiver moved to another machine is followed, and how (100)
H3 of design 011 stands: with ten thousand devices sending 2,000 records a second, the node's store, key and memo carried to another address, nothing stopped for a 100 ms step, the moved node made no X25519, and every record was applied once. Each device's first record after the move waits one probe (30-45 ms here), as its first packet finds no way there. The search found the listener answering from an address other than the one a packet came to, and a link that looked for its receiver after its probe went, losing every answer. H1-H4 are all measured now; 61 B's CPU a delivery is at the edge of the criterion, to be looked at before step 5 (adoption and a specification).
Diffstat (limited to 'docs/research/092-tpcc.md')
0 files changed, 0 insertions, 0 deletions