RippleLab

Mapping the blast radius

About

RippleLab

An open-source supply chain risk lab: find the packages that would hurt most, before an attacker does.

The problem

Modern applications import a handful of packages directly and inherit hundreds indirectly. The dangerous packages are rarely the ones teams chose — they are tiny, unglamorous utilities buried three layers down that every library happens to share. When one of those is hijacked, the compromise travels upward silently: event-stream, ua-parser-js and colors each broke thousands of applications that had never heard of them. Teams have inventories of what they depend on, but almost no way to answer the question that matters during an incident: if this package falls, what falls with it?

How RippleLab works

Step 1

Dependency extraction

Parse manifests and lockfiles into a normalised list of packages, versions and tiers.

Step 2

Graph construction

Build a directed graph where every edge records “A depends on B”, plus its reverse index.

Step 3

Propagation simulation

Reverse breadth-first search from a compromised node reveals the true blast radius, wave by wave.

Step 4

Interactive analysis

Centrality metrics, mitigation comparison and a plain-language report for responders.

The Ripple Score

Ripple = 0.3 · degree + 0.4 · betweenness + 0.3 · downstream reach

Degree centrality

How many packages touch this one directly, relative to the busiest node in the graph.

Betweenness centrality

How often this package sits on the shortest propagation path between two others (Brandes' algorithm).

Downstream reach

The fraction of end-user applications a compromise here would eventually reach.

ReactTypeScriptTailwind CSSForce GraphGraph TheoryDeterministic NLG

Team ECLIPSE

Manipal Institute of Technology

Mohammed Rayhan

Mukund S Belawadi

Poorvashree S

Aisiri Rajesh

Maahi Sachin Nale

Built for Manipal Hackathon 2026 · Cybersecurity Track