A library to find JS RegExp with super-linear worst-case time complexity for attack strings that repeat a single character.
This library statically analyzes JavaScript regular expressions to detect super-linear worst-case time complexity, specifically targeting patterns that can be exploited via ReDoS attacks using single-character repeated attack strings. It's designed as a lightweight, supplementary analysis tool for developers who need to quickly identify potentially dangerous regex patterns without performing full static analysis, particularly useful when working with backreferences and assertions where traditional analysis methods may fall short.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.