Results produced are still compatible with dropbox/zxcvbn.js 4.4.2 but this one solves an issue with performance that could cause considerable impacts.
This version makes the algorithm to work with performance linear O(n) in relation to size of passwords, before this change it could be polynomial O(n^c).
There are more details on zxcvbn Changelog and on issue: formigarafa/zxcvbn-rb#6 and the code changes on PR formigarafa/zxcvbn-rb#7.
Results produced are still compatible with dropbox/zxcvbn.js 4.4.2 but this one solves an issue with performance that could cause considerable impacts.
This version makes the algorithm to work with performance linear
O(n)
in relation to size of passwords, before this change it could be polynomialO(n^c)
.There are more details on
zxcvbn
Changelog and on issue: formigarafa/zxcvbn-rb#6 and the code changes on PR formigarafa/zxcvbn-rb#7.