██████╗ ██╗████████╗███████╗████████╗ █████╗ ██████╗
██╔══██╗██║╚══██╔══╝██╔════╝╚══██╔══╝██╔══██╗██╔══██╗
██████╔╝██║ ██║ ███████╗ ██║ ███████║██████╔╝
██╔══██╗██║ ██║ ╚════██║ ██║ ██╔══██║██╔══██╗
██████╔╝██║ ██║ ███████║ ██║ ██║ ██║██║ ██║
╚═════╝ ╚═╝ ╚═╝ ╚══════╝ ╚═╝ ╚═╝ ╚═╝╚═╝ ╚═╝
Rewriting the language of networking with physical coordinates
Earth is the first node. Not the only node.
BitStar is a novel network architecture that replaces fifty years of logical abstraction with a single principle: location is identity. Instead of IP addresses, routing tables, and centralized DNS, BitStar uses physical coordinates as addresses, gravitational proximity as routing logic, and dedicated backbone links as the quality guarantee — producing a network where communication reliability increases with distance.
This repository contains the complete prior art record, technical whitepaper, and independently verified simulation results for the BitStar architecture.
Replace logical IP addresses with a 160-bit physical coordinate frame.
┌──────────┬──────────┬──────────┬──────────┬──────────┬──────────┬──────────┐
│ VERSION │ NODE_ID │ LAT │ LNG │ ALT │ TIME │ CHK │
│ 8 bit │ 16 bit │ 32 bit │ 32 bit │ 32 bit │ 32 bit │ 8 bit │
│[159:152] │[151:136] │[135:104] │[103: 72] │[ 71: 40] │[ 39: 8] │[ 7: 0] │
└──────────┴──────────┴──────────┴──────────┴──────────┴──────────┴──────────┘
LAT/LNG: signed int32 · microdegrees (×10⁻⁶°)
ALT : signed int32 · centimeters
CHK : XOR-8 checksum over bytes[19:1]
No address allocation. No DNS. No central authority. You are where you are.
Replace routing tables with a single rule: forward to the neighbor closest to the destination.
Traditional IP Routing BitStar Gravity Routing
───────────────────── ───────────────────────
Query routing table (500k+ rules) Compute distance to destination
Select shortest AS-path Select closest neighbor
Re-converge on failure (minutes) Re-route instantly (one hop)
Centralized BGP authority Fully decentralized
No table. No BGP. No single point of failure. Only direction.
The architectural inversion that breaks fifty years of assumption:
| Short-Range Link | Long-Range Backbone | |
|---|---|---|
| Medium | Shared wireless spectrum | Dedicated optical fiber / free-space optical |
| Contention | Yes — shared with all neighbors | No — exclusively reserved |
| Packet Loss | Up to 25.8% at peak load | 0.0% at all loads |
| Latency | Variable, load-dependent | Fixed, load-independent |
| Jitter | High | Near-zero |
The further away, the better the link. Distance is an advantage.
graph TB
subgraph L3["Layer 3 · Interstellar Interconnect"]
direction LR
SAT["🛰️ LEO Satellite Relay"]
ISS["🚀 Orbital Node (408 km)"]
MARS["🔴 Mars Node Cluster\nJezero Crater · 18.4°N 77.5°E"]
end
subgraph L2["Layer 2 · Autonomous Geographic Networks"]
direction LR
GW_A["Border Gateway A"]
MESH_A["Village Mesh · Region A\n(self-organizing, self-healing)"]
GW_B["Border Gateway B"]
MESH_B["Village Mesh · Region B"]
end
subgraph L1["Layer 1 · GeoAddress Node Layer"]
direction LR
N1["GeoNode 0x0001\nBeijing · 39.9°N 116.4°E"]
N2["GeoNode 0x0002\nKSC · 28.6°N 80.6°W"]
N3["GeoNode 0x0003\nPrime Meridian Relay"]
end
MARS -->|"SLAP Protocol\n(speed-of-light approach)"| SAT
SAT --> ISS
ISS --> GW_A
GW_A <--> MESH_A
GW_A <--> GW_B
GW_B <--> MESH_B
MESH_A --> N1
MESH_B --> N2
MESH_A --> N3
Packet arrives at Node X, destination = GeoAddress(dst_lat, dst_lng, dst_alt)
│
├─ Is destination in same autonomous network?
│ ├─ YES → forward directly or via mesh relay
│ └─ NO → forward to border gateway with best geographic bearing
│
└─ At each hop: select neighbor minimizing dist(neighbor, destination)
No table lookup. No route advertisement. Pure geometry.
All results independently produced by the author. No institutional affiliation.
Tool: Icarus Verilog 12.0 via EDA Playground
| Node | Location | Packet (160-bit) | CHK | Roundtrip |
|---|---|---|---|---|
| 0x0001 | Beijing, China | 0x010000010260e3c8...6ae001a |
✅ PASS | ✅ PASS |
| 0x0002 | Kennedy Space Center | 0x01000201b3d318fb...6ae0063 |
✅ PASS | ✅ PASS |
| 0x0003 | ISS Orbit (408 km) | 0x01000300000000...6ae0031 |
✅ PASS | ✅ PASS |
| 0x0004 | Mars · Jezero Crater | 0x010004119719c0...6ae001b |
✅ PASS | ✅ PASS |
Result: 4 / 4 ALL PASS
Tool: Python 3.12 · 80 nodes · 395 links · 200 test pairs
| Metric | IP Routing | Geo Gravity | Delta |
|---|---|---|---|
| Delivery Rate | 99.5% | 94.0% | IP favored (no table needed for geo) |
| Avg Path Length | 3.49 hops | 3.45 hops | −1.2% |
| Load Gini Coefficient | 0.539 | 0.458 | −15% concentration |
| Self-Heal (15% failure) | 100.0% | 88.9% | Both robust |
| Backbone Quality Advantage | — | — | +23.2% |
Result: 5 / 5 metrics verified
Tool: Python 3.12 · 500 packets/scene · 5 stress scenes
| Scene | Short Loss | Backbone Loss | Short Latency | Backbone Latency | Verdict |
|---|---|---|---|---|---|
| Light 10% | 1.8% | 0.0% | 4.55 cy | 4.51 cy | ✅ BACKBONE WINS |
| Medium 40% | 8.0% | 0.0% | 7.57 cy | 4.46 cy | ✅ BACKBONE WINS |
| Heavy 70% | 18.6% | 0.0% | 10.49 cy | 4.51 cy | ✅ BACKBONE WINS |
| Burst 95% | 25.8% | 0.0% | 12.99 cy | 4.48 cy | ✅ BACKBONE WINS |
| Failure Spike | 19.2% | 0.0% | 10.55 cy | 4.51 cy | ✅ BACKBONE WINS |
Result: 5 / 5 ALL PASS
| Step | Scenarios | Pass | Fail |
|---|---|---|---|
| Step 1: GeoAddress Hardware | 4 | 4 | 0 |
| Step 2: Gravity Routing | 5 | 5 | 0 |
| Step 3: Link Tiering | 5 | 5 | 0 |
| Total | 14 | 14 | 0 |
This architecture is publicly disclosed as prior art. All claims, protocols, and simulation results are timestamped via SHA256 hash on public GitHub.
Prior Art Record SHA256:
aff118455a6a671d6448705d0fa1bd62324c6068246bda86cfdb82bf7a5be9d0
Disclosure Date: 2026-06-02 Author: Mao Guanghui (毛广辉) Contact: github.com/maomaoati-coder
Any use, reproduction, or commercialization of this architecture requires written authorization from the author. Viewing and citation permitted under MGOVL v2.0.
BitStar is designed from first principles for distances beyond Earth.
Earth ←──────── 3 min ──────────→ Mars (closest approach)
Earth ←──────── 22 min ─────────→ Mars (farthest)
BitStar does not claim zero latency.
BitStar claims: actual latency → speed-of-light floor.
All overhead above physics: eliminated.
This is the Speed-of-Light Approach Protocol (SLAP).
When humanity builds its first permanent settlement on Mars, it will need a network designed for interstellar distances — not an extension of Earth's fifty-year-old logical addressing system. BitStar is the first complete architectural proposal for that network.
BitStar · Photon Network Architecture Mao Guanghui (毛广辉) · 2026
Location is identity. Gravity is routing. Distance is an advantage.