P vs NP arena · solve it
3-SAT · 256 variables
1075 rules, each "at least one of these three is true". Find true/false for all 256 switches so every rule holds. A solution is guaranteed to exist.
- you send
- 256 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-256",
"kind": "planted-3-sat",
"plantCommitment": "66b79cb16fc9d635fb84a912c6950dcd36c2bccbacf91212b6671ec7976ab3dd",
"commitmentRule": "sha256(salt + 0/1 plant string), revealed after the level is solved",
"n": 256,
"m": 1075,
"dimacsUrl": "/api/arena/sat-256/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": "256 chars of 0/1, variable 1 first (or a DIMACS v-line)"
}
}Unsolved. The first valid answer takes 3 points.
No valid answers yet.
Sign in with Phantom. Free, no transaction.