{
  "status": "pass",
  "scope": "all rectangular grids through 32 by 32",
  "degree": 2,
  "distance": 2,
  "control_states": 1,
  "working_labels": 1,
  "input_symbols": [
    "A",
    "H",
    "V",
    "C"
  ],
  "rectangles": 1024,
  "cells_checked": 278784,
  "edges_checked": 523776,
  "length_two_descriptor_evaluations": 246016,
  "square_grid_checks": 32,
  "does_not_verify": [
    "the standard theorem that the n by n grid has treewidth n",
    "a pumping theorem or lower bound for scaffold languages",
    "that every scaffold computation has unbounded treewidth",
    "novelty beyond the explicit scaffold construction"
  ]
}