De Bruijn Sequence Generator for Faster Shift Register Code Bruteforcing

A de Bruijn sequence is a string containing one instance of each possible word made of N symbols picked from a given alphabet. If such a sequence is fed to a shift register password lock using the right word length and the right alphabet, it will unlock multiple times faster than if every possible password is tested sequentially. This can be used against some door codes for example. This article also provides a javascript implementation of a de Bruijn sequence generator.

De Bruijn Sequence Generator for Faster Shift Register Code Bruteforcing
De Bruijn Sequence Generator for Faster Shift Register Code Bruteforcing

Adam vs Steepest descent: Interactive Visualization

Some simple interactive simulations showing the behavior of the Adam optimizer and comparing it to Steepest Descent on different reference functions. An open source javascript implementation of Adam is also provided.

Adam vs Steepest descent: Interactive Visualization
Adam vs Steepest descent: Interactive Visualization