SAT Solver Core

126 / 138 SAT

x2=0

x5=1

x8=0

x11=1

Core-A

74/102

x7=1

x10=0

x1=1

x4=0

Core-B

66/90

x12=0

x3=1

x6=0

Core-C

98/121

x5=1

x8=0

x11=1

x2=0

x5=1

Core-D

108/130

x10=0

x1=1

x4=0

x7=1

Core-E

52/79

x3=1

x6=0

x9=1

Core-F

54/79

x8=0

x11=1

x2=0

x5=1

Core-G

78/100

x1=1

x4=0

x7=1

Core-H

59/78

(x1 | ~x3 | x9)

(~x2 | x5 | x11)

(x4 | x7 | ~x12)

(~x6 | x8 | x10)

(x2 | ~x4 | x13)

(x3 | x6 | ~x14)

CDCL-Agent-01

Computing

clauses

106/132

bounty

5000 SAT

Stochastic-Runner

Computing

clauses

95/126

bounty

3200 SAT

Clause-Weaver

Computing

clauses

111/136

bounty

7400 SAT

Bitflip-Hunter

Verifying

clauses

102/127

bounty

4100 SAT

ASSIGNMENT TAPE

[x1=0]

[x2=1]

[x3=1]

[x4=0]

[x5=1]

[x6=0]

[x7=1]

[x8=1]

[x9=0]

[x10=1]

[x11=0]

[x12=1]

Verifiable Outcome Marketplace

From NP-Complete
to Verifiable Reality

3SAT COIN is an open and decentralized protocol for posting, solving, and verifying SAT problems through cryptoeconomic incentives. Building an unprecedented corpus of large-scale SAT and constraint problems to advance the engineering frontier of NP-hard computation.

Open Docs Explore Protocol

From NP-Completeto Verifiable Reality

From NP-Complete
to Verifiable Reality