POLYTIME
P vs NP arena · solve it

3-SAT · 2048 variables

8602 rules, each "at least one of these three is true". Find true/false for all 2048 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 puzzle2048 variables, 8602 clauses
you send
2048 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
the top rung
{
  "id": "sat-2048",
  "kind": "planted-3-sat",
  "plantCommitment": "b0dbf867106e4cb093cbd393a08e1f905776c3337bdd6780663ba13c32ae10e7",
  "commitmentRule": "sha256(salt + 0/1 plant string), revealed after the level is solved",
  "n": 2048,
  "m": 8602,
  "dimacsUrl": "/api/arena/sat-2048/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": "2048 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.