3-SAT · 512 variables

you send

512 characters of 0 and 1 (switch 1 first), or a DIMACS "v" line.

we check

Checks every clause against your assignment.

score

Solved or not. First solve gets 3 points, later solves 1.

how hard

hard for simple local search; the hidden plant is balanced so majority tricks fail

{
  "id": "sat-512",
  "kind": "planted-3-sat",
  "plantCommitment": "caed4b2fffc25c34416da6c000b5298db83b4c8b22edaafc011ba7b1b4e13b5d",
  "commitmentRule": "sha256(salt + 0/1 plant string), revealed after the level is solved",
  "n": 512,
  "m": 2150,
  "dimacsUrl": "/api/arena/sat-512/instance?format=cnf",
  "rule": "Every clause must be satisfied. Planted with q-hidden planting (q = (sqrt 5 - 1)/2), so a solution exists.",
  "answer": {
    "bits": "512 chars of 0/1, variable 1 first (or a DIMACS v-line)"
  }
}