hwpythonner
If the goal is to cut costs — like vendors trying to avoid AWS/CDN bills — that’s a very different problem than building for censorship resistance or resilience.
Without a clear “why,” the tradeoffs (latency, peer churn, unpredictable bandwidth) are hard to justify. Centralized infra is boring but reliable — and maybe that's good enough for 99% of use cases.
The interesting question is: what’s the niche where the pain is big enough to make P2P worth it?
What do you think of this: instead of just deleting old entries, you could either do LRU (I guess Claude can help with it), or you could summarize the responses and store the summary back into the same table — kind of like memory consolidation. That way raw data fades, but a compressed version sticks around. Might be a nice way to keep memory lightweight while preserving context.
One thing I’m curious about: when expressing algorithms like this as static computation graphs, does that change their computational complexity in any meaningful way? For example, could certain problems end up with worse asymptotic behavior (O(n²) instead of O(n log n)) due to being flattened into a fixed graph with no branching or dynamic control?
I haven’t found a silver bullet that makes all of that feel cohesive. It's usually a balance between “what’s fast right now” and “what future me might understand.”
If it’s not intrinsic to FM, why not use existing cellular towers to do this? They’re everywhere, and phones already receive broadcast messages (like Amber Alerts) even without a SIM (I think) — so it feels like this could be done without needing new radios.
What makes this more accurate than cell tower triangulation today? Is the limitation in timing sync across towers, or something else in how cell networks are structured?
And for indoor use — how does this handle multipath? Reflections from walls or even atmospheric bounce seem like they’d throw off timing accuracy, similar to what messes with GPS in dense areas.