Cracking QWERTY

Standard wordlists like RockYou.txt target linguistic probability but do not account for spatial patterns generated by physical input devices. Users frequently utilize keyboard patterns (e.g., 1qaz@WSX) to meet complexity requirements while maintaining memorability. To target these patterns, I developed `kbwalk.py` (part of the keyb-walking repository), a Python-based generator optimized for creating spatial wordlists and rainbow tables. Development History This project is an iteration of the `kb-walk` concept originally authored by Ronald Broberg. My implementation builds on the codebase maintained by Austin Scott, refactoring the core logic to support direct cryptographic hashing and optimizing the traversal algorithms for modern hardware. ...

January 12, 2026 · Anton Hibl

Writing a Pythonic Complexity Scanner

Competitive programming often reduces algorithmic efficiency to Big O notation. While theoretically sound, Big O ignores the constants, interpreter overhead, and memory allocation patterns inherent in actual execution. A solution might be O(N) on paper but fail runtime constraints due to Python’s specific implementation details. I developed Occam to bridge the gap between theoretical complexity and hardware reality. The goal was to build a local profiling tool capable of analyzing solution behavior under stress before submission to platforms like LeetCode. ...

January 12, 2026 · Anton Hibl