A decentralized peer-to-peer messaging application that operates over Bluetooth

---

In your scenario, both A and K store the message for H -- suggesting replication (or perhaps, redundancy) by visiting peers. And maybe replication is OK.

It seems obvious that it can spiral out of control, but our pocket supercomputers do have a fair bit of bandwidth even at Bluetooth speeds, and flash memory is very cheap and available (a gigabyte of flash can hold a lot of short-ish text messages and costs very little).

So the network can afford quite a lot of replication in an effort to promote distribution -- and maybe that can work. Maybe the message isn't stored by just A and K, but also E, I, O, and U because they happened to stroll by and see the outbound message for H.

But there must be limits, if for no other reason than without limits then any single bad actor can ruin the whole works by exceeding the bandwidth and storage capabilities of the network.

These limits could be hop-based, or time-based, or geography-based, or any/all of the above.

Suppose a message lives until any of 50 hops or 5 days or 50 miles is exceeded? Yeah, maybe something like that works. The capabilities can be mathed to find some version of "ideal," and probably enforced somehow to prevent bad actors from doing too much bad stuff.

(But we're very rapidly straying very far from Fidonet's normal distribution behavior here, and dismantling that concept was the main crux of how I got to thinking about these things may theoretically work to begin with.)