Counter-UAS Mesh — Decentralized Drone Defense

The Core Insight

Why Every Other Approach Fails

Central command servers are the first target in any engagement. Once destroyed, the entire defense network goes dark. Blockchain is too slow. Raft isn't Byzantine fault-tolerant. Only Hashgraph DAG solves all three requirements simultaneously.

Technology	Speed	BFT	Offline	Cost	Verdict
Central Server	1ms	N/A	❌	$$	Single point of failure
Ethereum	12-15s	✅	❌	$2-50/tx	Drone escapes
Solana	400ms	✅	❌	$0.0025	Needs internet
Raft/Paxos	1-10ms	❌	✅	Free	1 bad node = broken
Hashgraph DAG	26-103ms	✅	✅	Free	✅ The only option

What Makes DAG Different

Traditional BFT protocols exchange O(n²) vote messages per round. Hashgraph eliminates votes entirely through virtual voting — each node computes how others would vote from the DAG structure alone. This is why 26ms consensus is achievable.

📡

No Internet Required

Nodes communicate directly — WiFi, mesh radio, any IP transport. When cell towers and satellites are jammed, the mesh still works.

🛡️

Byzantine Fault Tolerant

Up to ⌊(n-1)/3⌋ nodes can be compromised or malicious. Consensus still holds. Raft breaks with just one bad actor.

⚡

26ms Consensus

A drone at 100km/h moves 0.7m in 26ms vs 11m in Solana's 400ms. In targeting, that's the difference between hit and miss.

💰

Zero Gas Fees

Thousands of sensor readings per second. On Ethereum, that's millions in gas. On Vertex, it's free.

How It Works

From Detection to Intercept

1

Detection

3+ sensor nodes scan for hostile UAVs. Each reports bearing (direction) and RSSI (signal strength) to the P2P mesh.

2

Triangulation

When 2+ sensors detect the same target, DAG-ordered messages enable deterministic triangulation. Every node computes the same position — guaranteed by Vertex consensus.

3

Deterministic Auction

Interceptors bid with their distance. Vertex delivers bids in identical order to all nodes, so everyone independently computes the same winner. No explicit voting needed.

4

Intercept

Winning interceptor pursues and neutralizes the target. Position updates shared across mesh in real-time.

5

Failover

If an interceptor is destroyed mid-pursuit, heartbeat loss triggers automatic re-auction. Next-nearest interceptor takes over — within seconds, no human intervention.

┌──────────────────────────────────────────────────────┐ │ P2P Mesh (FoxMQ / Vertex DAG) │ │ │ │ Sensor A ──┐ │ │ ├── consensus → Triangulate → Auction ──► Interceptor X │ Sensor B ──┤ │ │ ├── consensus → Track → Auction ──► Interceptor Y │ Sensor C ──┘ │ │ │ │ No central command. No internet. No single point │ │ of failure. Byzantine fault tolerant. │ └──────────────────────────────────────────────────────┘

Deterministic Consensus

Why No Voting Is Needed

The key innovation: because Vertex delivers messages in the same order to every node, each node can independently run the same auction logic and arrive at the same result. This is deterministic consensus — no coordination messages, no voting rounds, no overhead.

# Every interceptor runs this independently.
# Vertex guarantees they all see bids in the same order.
# Therefore they all compute the same winner.

bids.sort(key=lambda b: (b["distance"], b["interceptor_id"]))
winner = next(b for b in bids if b["interceptor_id"] not in busy)

# No voting. No coordinator. Pure computation.
  

Resilience

What Happens When Things Break

Scenario	Response
Sensor destroyed	Remaining sensors continue (degraded accuracy with 2+ nodes)
Interceptor destroyed mid-pursuit	Heartbeat loss → automatic re-auction → next interceptor takes over
Compromised node sends false data	BFT consensus filters Byzantine behavior (up to ⌊(n-1)/3⌋ malicious)
Multiple simultaneous threats	Parallel detection + auction. N threats → N interceptors
All comms infrastructure destroyed	Local mesh radio still works. Vertex runs on any IP transport

Live Demo Output

See It Run

[S1] 🔍 Detected T-abc123 — bearing 13.3°, RSSI 78 [S2] 🔍 Detected T-abc123 — bearing 339.2°, RSSI 13 [S2] ⚠️ THREAT CONFIRMED: T-abc123 at (54.5, 106.1) [I1] 📡 Threat T-abc123 — dist 82, bidding [I2] 📡 Threat T-abc123 — dist 50, bidding [I2] 🏆 Won auction for T-abc123 [I2] 🎯 ASSIGNED → intercept T-abc123 [I2] → Moving to (60.1, 45.2), dist=35, fuel=96% [I2] → Moving to (55.3, 78.4), dist=15, fuel=93% [I2] 💥 INTERCEPTED T-abc123! ✅ All threats neutralized!

The Bigger Picture

An Untapped Opportunity

Hashgraph was invented in 2016 but locked behind patents until 2022, when Hedera open-sourced the IP under Apache 2.0. The defense community hasn't noticed yet — drone swarm research still uses Raft (not BFT) or Ethereum (too slow).

The Pentagon is actively soliciting drone swarm systems with "decentralized control" and "no single point of failure." Counter-UAS Mesh is built on the technology that was literally designed for this problem.

🎯

Counter-UAS

Detect, track, and intercept hostile drones without central command. The first application of Hashgraph to defense.

🤖

Swarm Coordination

Friendly drone fleets that self-organize, negotiate tasks, and heal when units are lost. Multi-vendor interoperability.

🛰️

Resilient ISR

Intelligence, surveillance, and reconnaissance that survives infrastructure destruction. Data consensus at the edge.

Tech Stack

Built With

Component	Technology	Why
Coordination	FoxMQ (MQTT 5.0 on Vertex DAG)	BFT consensus-ordered messaging
Agents	Python + paho-mqtt	Rapid prototyping
Consensus	Hashgraph (via Tashi Vertex)	26-103ms BFT, no internet, gasless
Dashboard	HTML Canvas + REST polling	Real-time 2D battle map
Transport	UDP (QUIC)	Low-latency P2P

DecentralizedDrone DefenseWithout Internet