E-Graph Constraint Satisfaction
Vulnerability Detection via Equality Saturation
How the CST engine uses e-graphs and equality saturation to detect EVM vulnerability patterns in under a second, without external solver dependencies.
- Structurally avoids the path-explosion that slows SMT-based analysis
- Sub-second vulnerability detection
- Zero external solver dependencies