These are manual measurements taken on the development Mac in November 2026. There are no raw result files for them; the numbers below are the recorded results.
Ours (own engine)
| Database load time | 2026-11-09 | 60–77 s | ~11 s | about 5.5–7× faster |
|---|---|---|---|---|
| Scan memory: re-scan of Numbers.app (33819 files) | 2026-11-11 | 131.7 s | 24.7 s | about 5.3× faster |
TLSH candidate restriction in SQL (tlsh_candidates_within) | 2026-11-09 | — | — | 718/718 identical results, ~1.6× faster |
- Database load time: time to load the signature and hash databases at engine start.
- Scan memory: the scanner remembers files it has already scanned, so a second scan of the same application bundle (Numbers.app, 33819 files) only has to handle what changed.
- TLSH in SQL: the set of TLSH fuzzy-hash candidates within a distance limit is restricted already in
the SQL query (
tlsh_candidates_within); all 718 compared results were identical to the previous method.
External libraries
pyahocorasick (save/load of a prebuilt automaton, pickle) | 2026-11-09 | load time | 76 s |
|---|---|---|---|
ahocorasick_rs (build the automaton) | 2026-11-09 | build time | ~25 s |
| Building the automaton in threads (sharding) | 2026-11-09 | build time | no speedup (GIL) |
- Loading a pickled
pyahocorasickautomaton (76 s) was slower than building one from scratch withahocorasick_rs(~25 s), soahocorasick_rsstays, and the automaton is built lazily (only when it is first needed). - Splitting the pattern set into shards and building them in parallel threads gave no speedup, because of Python's global interpreter lock (GIL).