HomeArenaGraphSignalTopics

/ The Arena

Prove your engineering skills.

GLOBAL+50 XP

HNSW Multi-Layer Vector Proximity Search Graph

Problem Overview

Hierarchical Navigable Small World (HNSW) graphs enable sub-10ms Approximate Nearest Neighbor search over millions of high-dimensional vectors.

In this landmark capstone, you will implement an HNSW Vector Proximity Graph Search Engine featuring:

  1. Multi-layer graph construction with skip-list level assignments.
  2. Top-down greedy graph traversal.
  3. Beam-search nearest neighbor discovery in Layer 0 with dynamic efSearch.

Join The Arena

Create an account to submit your implementation, test against our containerized CI suite, and climb the global leaderboard.

Create Account

ALREADY HAVE AN ACCOUNT? LOG IN