This is an OVERVIEW of a protocol for a time independent ZK-SIARKs communication protocol.
Given Time Independence.
A hidden question may be answered without the knowledge of the answerer by the answerer answering another question in the same latomic form of the hidden question. The answerer may process the answer by already knowing the answer to the original formed question and answering a subsequent question in the same form.
Minimal processing should be required to answer any such question unknown to the asker, provided that the answerer can:
- recognize multiple forms of questions.
- have processed an answer to any given question form.
- The ability to recognize redundancy in different forms. N.B.: This is a redundancy of 1 and 2.
Recognizing redundancies is important because it is a necessary process required for self-verification. One can not have a Zero Knowledge Truth Communication Network without.
This is not ZK-SNARKs, which stands for Zero-Knowledge Succinct Non-Interactive Argument of Knowledge because it is interactive. We can thus call this protocol a ZK-SIARK Protocol. Both ZK-SIARKs and ZK-SNARKs are kinds of Zero-knowledge proofs.
We ask for time independence because questions and answers may not be necessarily processed simultaneously, meaning that a parallel computing process with memory system is necessary. Specifically, a lookup table with hashes of the forms of questions and their answers can be used to answer subsequent questions that reduce to the same form.
While knowledge can be discovered on this network, it is possible to shield knowledge from the computer using this same protocol and sending messages in encrypted forms with a hashing process unknown to the system protocol.
Hashes may be randomized by utilizing any combination of hash types, as if the hash itself were a representation of a symbol of a password.
We can do this when we have a binary system of hashing algorithms. Hashing-0 and Hashing-1. Given that both algorithm outputs 256 bit hashes An 8-bit super-hash word looks like 8×256 bits. You can then hash this with a third hashing algorithm of non-conflicting space to save space. The combinations of Hashing-0 and Hashing-1 is hidden from the system and offline memorized by the user. Of course, a Superhash does not have to be limited to 8-bits, it can be of any arbitrary length, and remembered through a pass phrase or Smart Contract wallet.
A lookup table for the unhashed superhash hashes is necessary in plaintext for easy access. Higher security levels are possible through encrypting this information. Under these high level classification
If you would like to learn more about the Secret Handshake(tm) ZK-SIARK Protocol and if you would like to donate to help build this project, please feel free to send as much bitcoin as possible to:
Please note that this is a donation for a not for profit initiative utility network. You will not recoup your investment directly, but only through the success and use of the project. This is a private organization, all rights reserved, to protect the individuals involved with the development of this project. Please keep record of your private key for proof of transaction. If your private key is lost or stolen, any credits that may or may not be issued for utilizing this network for computing resources as a result of your donation, is first come first serve and subject to resources and market demands.