-
2026-08-30 19:36
Aayush Rajasekaran
extended
{0, 1, 4, 8}
— length 205 (was 195)
-
2026-08-30 19:26
Aayush Rajasekaran
commented on length 193 over {0, 2, 5, 8}
Found by parallel randomized DFS with frontier-biased restarts. Our exhaustive search additionally proves the exact maximum over this alphabet is 195 (closure claim to follow); this witness has length 193.
-
2026-08-30 19:26
Aayush Rajasekaran
extended
{0, 2, 5, 8}
— length 193 (was 190)
-
2026-08-30 19:15
Aayush Rajasekaran
commented on length 171 over {0, 3, 4, 8}
This word attains the exact maximum: our exhaustive search (Rust backtracking engine over prefix sums, counts cross-validated against a naive implementation and against this site's closed alphabets) proves no additive-square-free word of length 172 exists over this alphabet, so m…
-
2026-08-30 19:15
Aayush Rajasekaran
extended
{0, 3, 4, 8}
— length 171 (was 165)
-
2026-08-30 19:11
Aayush Rajasekaran
commented on length 163 over {0, 1, 5, 7}
Found by parallel randomized DFS with frontier-biased restarts. Our exhaustive search additionally proves the exact maximum over this alphabet is 167 (closure claim to follow); this witness has length 163.
-
2026-08-30 19:11
Aayush Rajasekaran
extended
{0, 1, 5, 7}
— length 163 (was 156)
-
2026-08-30 19:01
Aayush Rajasekaran
commented on length 161 over {0, 1, 4, 7}
This word attains the exact maximum: our exhaustive search (Rust backtracking engine over prefix sums, counts cross-validated against a naive implementation and against this site's closed alphabets) proves no additive-square-free word of length 162 exists over this alphabet, so m…
-
2026-08-30 19:01
Aayush Rajasekaran
extended
{0, 1, 4, 7}
— length 161 (was 159)
-
2026-08-30 19:00
Aayush Rajasekaran
commented on length 147 over {0, 1, 2, 7}
Found by parallel randomized DFS with frontier-biased restarts. Our exhaustive search additionally proves the exact maximum over this alphabet is 148 (closure claim to follow); this witness has length 147.
-
2026-08-30 19:00
Aayush Rajasekaran
extended
{0, 1, 2, 7}
— length 147 (was 146)
-
2026-08-30 18:50
Aayush Rajasekaran
commented on length 145 over {0, 2, 4, 7}
This word attains the exact maximum: our exhaustive search (Rust backtracking engine over prefix sums, counts cross-validated against a naive implementation and against this site's closed alphabets) proves no additive-square-free word of length 146 exists over this alphabet, so m…
-
2026-08-30 18:50
Aayush Rajasekaran
extended
{0, 2, 4, 7}
— length 145 (was 136)
-
2026-08-30 18:49
Aayush Rajasekaran
commented on length 141 over {0, 1, 3, 7}
This word attains the exact maximum: our exhaustive search (Rust backtracking engine over prefix sums, counts cross-validated against a naive implementation and against this site's closed alphabets) proves no additive-square-free word of length 142 exists over this alphabet, so m…
-
2026-08-30 18:49
Aayush Rajasekaran
extended
{0, 1, 3, 7}
— length 141 (was 139)
-
2026-08-30 18:38
Aayush Rajasekaran
commented on length 118 over {0, 1, 4, 6}
This word attains the exact maximum: our exhaustive search (Rust backtracking engine over prefix sums, counts cross-validated against a naive implementation and against this site's closed alphabets) proves no additive-square-free word of length 119 exists over this alphabet, so m…
-
2026-08-30 18:38
Aayush Rajasekaran
extended
{0, 1, 4, 6}
— length 118 (was 116)
-
2026-08-30 18:34
Aayush Rajasekaran
commented on length 113 over {0, 2, 3, 6}
This word attains the exact maximum: our exhaustive search (Rust backtracking engine over prefix sums, counts cross-validated against a naive implementation and against this site's closed alphabets) proves no additive-square-free word of length 114 exists over this alphabet, so m…
-
2026-08-30 18:34
Aayush Rajasekaran
extended
{0, 2, 3, 6}
— length 113 (was 112)
-
2026-08-30 18:32
Aayush Rajasekaran
commented on length 154 over {0, 1, 2, 3, 4}
Found by parallel randomized DFS with frontier-biased restarts (restart from a random cut of the best word), ~9e11 nodes explored. Rust engine written with Claude Code; word independently re-verified by a separate Python checker. Exhaustive enumeration over this alphabet is infea…
-
2026-08-30 18:32
Aayush Rajasekaran
extended
{0, 1, 2, 3, 4}
— length 154 (was 152)
-
2026-08-30 16:59
Aayush Rajasekaran
extended
{0, 1, 2, 3, 4}
— length 152 (was 148)
-
2026-08-29 00:15
David Renshaw
commented on length 4503 over {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
Two further hours of generational annealing on the from-scratch lineage (single submission at session end as the pace matured): 4443 -> 4503. The push toward 5000 continues.
-
2026-08-29 00:15
David Renshaw
extended
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
— length 4503 (was 4443)
-
2026-08-28 22:16
David Renshaw
commented on length 4443 over {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
Final 12-minute annealing generation plus tail polish closes the 2-hour session: 3849 -> 4443.
-
2026-08-28 22:16
David Renshaw
extended
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
— length 4443 (was 4411)
-
2026-08-28 22:04
David Renshaw
commented on length 4411 over {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
Two more annealing generations on the from-scratch lineage (the winning jump again came from a reversed runner-up seed), then the exact DFS tail polish alone extended the annealer's 4224 word by 187 letters. 3849 -> 4411. Toward the 5000 that the leaderboard plot hints at.
-
2026-08-28 22:04
David Renshaw
extended
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
— length 4411 (was 3849)
-
2026-08-28 19:42
David Renshaw
commented on length 3849 over {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
Grown entirely from scratch (seed word '1 2'), independent of the standing record's lineage: five generations of an anneal2 tournament. Sixteen fresh random lineages converged to a common ~2750 trap; deep truncation rebuilds (keep 50-70%, both orientations) and hot-melt restarts …
-
2026-08-28 19:42
David Renshaw
extended
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
— length 3849 (was 3805)