We are running a German non-profit foundation gridsat.eth/ deploying an Open- and Free Everything NDP with unlimited linear scalability over the global computing grid.
To keep the NDP open and free, we publish on IPFS appreciating your pinning efforts which we keep current in his very thread.
We are well aware about well justified scepticism concerning an NDP especially considering the scientific approach with logic and linguistics (Classic Arabic) yet this is why we were able to deploy on IPFS and post here - any questions and support requests please drop a message.
hi, thanks for asking! The NDP efficiently solves any SAT problem (Boolean satisfiability problem) with CNF/DIMACS (Conjunctive Normal Form) input - specifically, 3SAT with 3CNF input (3 vars/clause) - typical SAT problems are rather abstract but broken down a little bit they include thousands of logical decision problem such as routing, molecular- and material design, Artificial general intelligence (AGI) and so forth (among others, we put some disruptive applications in a 2min video on gridsat.eth/ - the NDP outputs so called “Binary Decision Diagrams” (BDDs) which are equivalent to the truth table in Boolean algebra, e.g., the BDD for a 64bit multiplication circuit where all multiplication operations within the bit-range would have been processed ready for readout by just setting the respective input bits - please feel free to dig deeper at any time!
To make this more available in more decentralized fashion. I would recommend to use Crust Network Pinner which you may easily integerate into your production pipeline.
thanks for your interest and feedback! kindly suggest to visit the resources page on gridsat.eth/ (gridsat.io) - a good starting point could be the 45min lecture on #2SAT (read: count 2SAT = NP hard) - this lecture refers to the respective paper “#2SAT is in P” -