Shorter Worldlists for a Better World
Kolmogorov complexity equates the information content of an item with the length of the shortest program in a given language that can produce that item. On this web page, we provide a set of leaderboards for programs that compute the Kolmogorov complexity (in Javascript) of various word lists. You are welcome and invited to help us improve the bound by developing and submitting ever-shorter programs.
| rank | bytes | entry | author | URL |
| 1 | 153284 | tree-v4 | ix | |
| 2 | 161475 | zyzzyvas | tom7 | |
| 3 | 175362 | zyzzyvas | tom7 | |
| 4 | 182268 | zyzzyvas | tom7 | |
| 5 | 189344 | zyzzyvas | tom7 |
View the full leaderboard, download the wordlist, or submit an entry.
| rank | bytes | entry | author | URL |
| 1 | 2586 | yourself | tom7 | |
| 2 | 2773 | yourself | tom7 | |
| 3 | 3567 | yourself | tom7 | |
| 4 | 4150 | bitpack-v0 | ix | |
| 5 | 4470 | dedup-v0 | ix |
View the full leaderboard, download the wordlist, or submit an entry.