Implement an SSA-Based Sparse Conditional Constant Propagation Pass
Overview
What this challenge is about.
Read the IR specification (SSA form, phi nodes, typed values). Implement SCCP as a single combined worklist algorithm operating on the SSA lattice (top / constant / bottom) and a CFG-edge worklist. Replace constants and remove proved-dead blocks in a single pass. Wire the pass behind --opt=sccp in the existing optimizer driver. Run the 240-program benchmark and report: average static instruction reduction, dynamic instruction reduction on a 12-program hot path, and zero failures on the 4,800-test conformance suite.
The Brief
What you'll do, and what you'll demonstrate.
Implement SCCP on an existing SSA IR, prove static and dynamic instruction-count wins on a 240-program benchmark, and ship with zero conformance regressions.
Earning criteria — what you'll demonstrate
- Implement a combined value + reachability worklist algorithm
- Reason about lattices and meet operations on a real IR
- Validate optimizer correctness with a conformance suite
- Communicate optimization wins to a performance-driven team
Program Fit
Where this fits in your program.
Sharpens the same skills your degree expects you to demonstrate.
Skills
Skills you'll demonstrate.
Each one shows up on your verified credential.
Careers
Roles this prepares you for.
Real titles. Real skill bridges. Pick the one closest to your trajectory.
Career mappings coming soon.