RFC Proposal: Golod-Shafarevich deterministic pruning for GossipSub meshes (RFC 0001 OGSP)

[Betriomf]

Hi libp2p maintainers,

I have published an RFC specification (RFC 0001 OGSP) introducing deterministic O(1) bitwise packet pruning for mesh routing protocols.

By evaluating the invariant r > ((d * d) >> 2) prior to message validation, nodes discard echo loops with near-zero latency (0.30 ns in Rust), saving 96.19% of network bandwidth under stress tests.

Full RFC and benchmark suite:
https://github.com/Betriomf/Oasis-Sovereign-Monolith

Author: Mariano Panzano Caballé mpc.3.14@gmail.com