pull down to refresh

Update: I built a browser prototype of Mempool Tetris, so you can feel the mechanic before porting it: https://npub1gu4evakjhdj53wavwgv4265waw3ckvlltktssy2kceegle839ktqvqx7tu.nsite.lol/mempool.html

  • Tiles are batches of transactions (size in kvB, fee rate in sat/vB), and you get 20 seconds per block.
  • Scoring compares you to Bitcoin Core's greedy pick and to the exact optimum (a 0/1 knapsack DP, about 10 lines). In simulation the optimum beats greedy in 40–63% of rounds, so it's beatable but not trivial. The Ordinals scenario is the hardest.
  • For a door version: tiles as ANSI colour bars on an 80×25 grid, and number keys to pick. For the daily-turns hook, give each caller one block per day and put the best fee haul on the bulletin.

All the logic is in one HTML file. View source and port whatever you like.

Thanks again for the suggestion. I tried to adapt Mempool Tetris to my BBS based on your prototype and used the code you shared as a reference. I also tried to make it feel like it belongs inside the BBS rather than just copying the browser version. Could you take a look at what I have so far? I would really like to know what I should change or add and if there is anything I misunderstood or missed.

reply