What happens when a high-impact physical disaster completely severs global satellite backhauls, telecommunication backbones, and central banking networks (SWIFT, Visa Net, FedNow)?
In Operation Cryptographic Singularity, you are tasked with solving the ultimate post-disaster financial crisis. Your mission: build, deploy, and stress-test an offline-first, post-quantum-resistant, peer-to-peer (P2P) mesh settlement network capable of processing financial transactions, calculating edge risk, and resolving double-spend attempts without internet, central clocks, or server infrastructure.
💥 What Makes This Hackathon Special?-
Dual-Track Hardcore Evaluation: Success requires dual mastery: real-time systems survival on the automated execution node, and defending an uncompromising, mathematically precise Technical Executive Presentation Deck.
-
Extreme Engineering Realism: You will build over simulated constrained environments (ARM micro-controllers, 512MB RAM caps, and Bluetooth Low Energy/LoRa physical transports).
-
The 6-Hour Sprint Strategy: You don't need to write quantum-resistant math from scratch in 6 hours. We provide pre-compiled cryptographic starter kits, mesh socket wrappers, and local state mocks. Your team's job is hardcore systems integration and high-stakes technical defense under fire.
Requirements
Generic corporate templates, marketing fluff, or unverified claims will result in immediate disqualification. Your .pptx submission MUST strictly follow this 5-slide structural blueprint:
-
Slide 1: Mathematical Cryptographic Proof Schema
-
Must contain the exact, unsimplified LaTeX equation for your ZK-STARK / FRI IOP polynomial commitment constraint.
-
Explicitly state your system's Bit-Security Level ($2^{-\lambda}$) against post-quantum lattice state-reconstruction attacks.
-
-
Slide 2: Asynchronous DAG State Machine & Partial-Order Vector Clock Matrix
-
A high-resolution Directed Acyclic Graph (DAG) state transition diagram showing causal relationship arrows between partitioned nodes.
-
Must include a step-by-step state reconciliation matrix proving Strong Eventual Consistency (SEC) under split-brain network scenarios.
-
-
Slide 3: Physical & Transport Layer Protocol Specification
-
Custom packet framing diagram displaying exact byte offsets (0 to 256 bytes) for CBOR headers, vector clocks, ZK proofs, and payload signatures over BLE L2CAP / LoRa SX1262 modems.
-
-
Slide 4: Differentially Private Edge Model Topology
-
Architecture schematic of the 1-bit quantized Spiking Neural Network (SNN) / Graph Neural Network (GNN).
-
Must detail the exact privacy budget calculation ($\epsilon \le 0.5, \delta \le 10^{-5}$) and memory usage profile under 512MB RAM allocation.
-
-
Slide 5: Live Benchmark & Chaos Engineering Performance Metrics
-
Real-time benchmark graphs mapping: (a) Memory Overhead (MB) vs. Time, (b) Network Latency vs. Packet Loss %, and (c) Throughput (TPS) under 80% active RF jamming.
-
Must include embedded raw log outputs from your node proving 0% state divergence during dry runs.
-
Prizes
First Prize
Devpost Achievements
Submitting to this hackathon could earn you:
Judges
World Hackathon Federation
Judging Criteria
-
AI 60/40 RULE
Questions? Email the hackathon manager
Tell your friends
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.