mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2026-11-22 19:58:07 +00:00
Two of the phases left after the state file and table build fixes. PartialSumProperty() evaluated each of the 16 four bit suffixes as its own chain of filter() calls, but the suffixes share prefixes, so walking them as a binary tree needs 31 calls instead of about 64. Output verified identical for all 2^21 state and half combinations. update_allbitflips_array() accumulated an AND over 256 state arrays for the even and the odd half one after the other, although the halves share no data. Run them side by side. init_part_sum_bitarrays 1.095 s -> 0.425 s update_allbitflips_array 0.847 s -> 0.520 s Key still recovered on a hard prng 4K, live and from a nonce file, and by hf mf hardnested -t. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>