Open- and Free Everything Non-deterministic Processor (NDP) through IPFS

Hello dear IPFS community!

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.

NFT with NDP source code: QmNZ6pKjn5s68MazQycJwazymio9rGx3i6qZqCDsgfzgBPA
NDP git repository: QmYjdbvH4fvrJosbn9Nu85QUZB9MQC9P6CwozcMJELepSj
gridsat.eth: QmQeJ7VBprbEq2EadPEQJM4B7eqfbekGk3sRqQACYEvVC1

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.

2 Likes

Interesting… What can you compute exactly with this processor?

2 Likes

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!

2 Likes

CID-update

NFT with NDP source code: QmNZ6pKjn5s68MazQycJwazymio9rGx3i6qZqCDsgfzgBP
NDP git repository: QmYjdbvH4fvrJosbn9Nu85QUZB9MQC9P6CwozcMJELepSj
gridsat.eth: QmekWy8Nrie8gxB26K3F9WKHMR8g74dsHQpqFKSRmbte5U

CID-update

NFT with NDP source code: QmNZ6pKjn5s68MazQycJwazymio9rGx3i6qZqCDsgfzgBP
NDP git repository: QmYjdbvH4fvrJosbn9Nu85QUZB9MQC9P6CwozcMJELepSj
gridsat.eth: QmWxzTDuZzDGD24tv2cukJhUo5H8CF9bUqA8bxZR7Y77UK

1 Like

CID-update

NFT with NDP source code: QmNZ6pKjn5s68MazQycJwazymio9rGx3i6qZqCDsgfzgBP
NDP git repository: QmYjdbvH4fvrJosbn9Nu85QUZB9MQC9P6CwozcMJELepSj
gridsat.eth: QmcqvBRxGzhghTjY3fd6JMMEsXDDAmyaNrvz2zzrZkxKPm

CID-update

gridsat.eth: QmVTu2CoDfqv732DYuKobUCEgkRdSoCHDdQ3o7xF1H3UEn

CID-update

gridsat.eth/: QmV3o7utXqmp5YwEWY9WoorzuSaL9QbMoZ2nwt7ocjKnq1

CID-updates

NDP git repository with Ray: QmUezbkQV2bPh3HzYbLe8YsgNHgaRC3a7cWKh2kiVYrdAQ
gridsat.eth: QmSrS25jR29DXmqzMXMTrnSWeSu3dUu9z3jCMuiwnBXFST

CID-updates

gridsat.eth: QmRc5pS245Wo6JGHKV3r3Z746S5nhBxsbPXsw6ESvyZhT8

contains a new mirrored paper:

N. Abdelwahab
Three Dogmas, a Puzzle and its Solution
J. Acad. (N.Y.) 2023, Vol. 12,1:3-101
ipfs://QmcczrL8Qow66Xt3aJJpnn98Y5MCAMRWBYWFSK2V17Ks8F

CID: QmcczrL8Qow66Xt3aJJpnn98Y5MCAMRWBYWFSK2V17Ks8F

IMPORTANT CID-updates

new NDP git repository with Ray and more statistics: QmeTezFeoEXoQCQuC2TcKBQ5v2WpdD9duSLqbixpTy7ceB

gridsat.eth update: QmUjE21vHEGfKKA9ovtaSDFfiCF2ZEuHk9t9Gv6AR5HPsL

IMPORTANT CID

new git repository for the CNF Generator for Factoring Problems by Paul Purdom and Amr Sabry:

QmeeDsP4WnHG5F8dYazDnyUGhdnF1t8J4i4YAMgXCa6wB4

Currently hosted at:
https://cgi.luddy.indiana.edu/~sabry/cnf.html

and:

IMPORTANT CID-updates

  1. NDP git repository for FACT (NDP-h.git): Qmd41YYgoAvz42QVypeeJiBLXG7NDP5hjrCD5dsKvVA7ob

  2. CNF-generator for FACT (CNF_FACT-MULT.git): QmYuzG46RnjhVXQj7sxficdRX2tUbzcTkSjZAKENMF5jba

  3. gridsat.eth update: QmbguqMB2nEik24tbpgqmV2ozeWKBL5Cs38i44KGTJoevS

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.

1 Like

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” -

thank you so much! working on it walking through the complexity…