Emergency comms
without the network

// Kademlia lookup: find k closest nodes to target
async function kademliaLookup(targetId) {
  // Step 1: Find α closest nodes from local table
  const closest = routingTable.findClosest(targetId, α=3);
  const queried = new Set();

  // Step 2: Iterative lookup — query closest unqueried
  while (closest.some(n => !queried.has(n.id))) {
    const next = closest.filter(n => !queried.has(n.id)).slice(0,α);
    const results = await Promise.all(next.map(n => n.findNode(targetId)));
    next.forEach(n => queried.add(n.id));

    // XOR metric: distance = myId XOR targetId
    results.flat().forEach(node => {
      const dist = xorDistance(node.id, targetId);
      routingTable.insert(node, dist);
    });
    closest.sort((a,b) => xorCmp(a.id,b.id,targetId));
  }
  return closest.slice(0,k=20);
}

// TTL-based flood routing with deduplication
function routePacket(packet) {
  // 1. Deduplicate: reject already-seen packet IDs
  if (seenPackets.has(packet.id)) return;
  seenPackets.add(packet.id);

  // 2. Decrement TTL — drop if expired
  packet.ttl -= 1;
  if (packet.ttl <= 0) return;

  // 3. Check if we're the destination
  if (packet.to === myPeerId || packet.to === "broadcast") {
    deliver(packet);
    if (packet.to !== "broadcast") return;
  }

  // 4. Rebroadcast to all known peers
  peers.forEach(peer => {
    if (peer.id !== packet.from) peer.send(packet);
  });
}