{
  "id": 455,
  "alphabet_id": 1,
  "alphabet": [0,1,2,3,4],
  "length": 154,
  "previous_length": 152,
  "word": [0,2,0,1,4,2,0,2,4,2,0,3,1,0,2,0,1,0,2,4,2,0,2,4,3,4,1,2,0,2,3,4,2,1,3,2,4,2,3,1,0,2,0,1,0,2,4,2,3,2,1,3,4,2,1,0,2,4,3,4,1,3,4,2,4,3,4,1,3,0,3,4,2,3,1,0,2,0,4,2,1,2,4,3,4,1,3,4,3,0,2,0,3,1,0,2,0,1,0,2,4,2,0,1,0,2,0,3,1,0,2,0,1,0,2,4,2,3,2,1,0,2,3,1,2,4,3,4,2,4,3,1,3,2,0,2,1,0,2,3,1,3,4,1,0,1,2,3,4,0,3,0,2,3],
  "submitter": "Aayush Rajasekaran",
  "created_at": "2026-08-30 18:32:37",
  "comments": [
    {
      "author": "Aayush Rajasekaran",
      "created_at": "2026-08-30 18:32:37",
      "content": "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 infeasible for us (tree to length 70 alone is ~1e15 nodes), but probe progress stalls hard near 154, suggesting the maximum is not far above."
    }
  ]
}