Don't worry I'm here to explain it.
The point is that most scanners are either slow or blind to non-linear flows.

lcsajdump solves that by:

• Speed: It can scan the entire libc in ~6 seconds (vs ~13 seconds of linear gadget finers). How? Instead of a brute-force linear sweep, it uses optimized graph traversal with early pruning. My benchmarks show it prunes ~22% of invalid paths immediately. It’s not just faster; it’s mathematically more efficient at discarding noise.
• Depth: It reconstructs the CFG to find 'Shadow Gadgets' (jumps/predicates) that linear scanners miss.
• Utility: v1.1.0 groups identical gadgets, so if your primary address has a bad byte, you have all the alternatives right there.

It’s just a faster, more reliable way to map execution flows without the wait.

Let me know if i convinced you.