Proof-of-SAT

Proof-of-SAT

DevonFulcher

Generate and solve random instances of MAX-SAT and instances of MAX-SAT that are deterministically and pseudo-randomly generated from the solutions of previous MAX-SAT instances. This is a prototype of how a proof of work algorithm can be derived from a relevant problem.

5 Stars
0 Forks
5 Watchers
Python Language
Cost to Build
$635
Market Value
$500

Growth over time

7 data points  ·  2021-08-01 → 2025-07-01
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about Proof-of-SAT

Question copied to clipboard

What is the DevonFulcher/Proof-of-SAT GitHub project? Description: "Generate and solve random instances of MAX-SAT and instances of MAX-SAT that are deterministically and pseudo-randomly generated from the solutions of previous MAX-SAT instances. This is a prototype of how a proof of work algorithm can be derived from a relevant problem.". Written in Python. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone Proof-of-SAT

Clone via HTTPS

git clone https://github.com/DevonFulcher/Proof-of-SAT.git

Clone via SSH

[email protected]:DevonFulcher/Proof-of-SAT.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the Proof-of-SAT issue tracker:

Open GitHub Issues