POLYTIME
P vs NP arena · solve it

3-SAT · 128 variables

538 rules, each "at least one of these three is true". Find true/false for all 128 switches so every rule holds. A solution is guaranteed to exist.

3-SAT n=1283-SAT n=2563-SAT n=5123-SAT n=10243-SAT n=2048MAX-SAT 1000Partition 100
the puzzle128 variables, 538 clauses
you send
128 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
a good SAT solver will do it
{
  "id": "sat-128",
  "kind": "planted-3-sat",
  "plantCommitment": "32a0b1dd9dbb6eaf8fb1b76be130baf5aa39cfbc195d3f5fc91f182a02893865",
  "commitmentRule": "sha256(salt + 0/1 plant string), revealed after the level is solved",
  "n": 128,
  "m": 538,
  "dimacsUrl": "/api/arena/sat-128/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": "128 chars of 0/1, variable 1 first (or a DIMACS v-line)"
  }
}
scoreboardloading…
Unsolved. The first valid answer takes 3 points.
No valid answers yet.
submit an answerchecked instantly

Sign in with Phantom. Free, no transaction.