Principally new search
The paper is available at:
https://github.com/cybercongress/cyber/releases/tag/1.0.0
and using the following hash
https://ipfs.io/ipfs/QmceNpj6HfS81PcCaQXrFMQf7LR5FTLkdG9sbSRNy3UXoZ
The main properties: - The ranking is sybil-resistant - No trusted third parties - Participants can be anonymous
cyber: Computing the knowledge of the Great Web.
Abstract: A consensus computer allows for the computing of provably relevant answers without any opinionated blackbox intermediaries, such as Google, Amazon or Facebook. Stateless, content-addressable peer-to-peer communication networks, such as IPFS, and stateful consensus computers such as Ethereum, are only able to provide part of the solution needed to obtain akin answers. But, there are at least 3 problems associated with the above-mentioned implementations. The first problem is the subjective nature of relevance. The second problem is the difficulty in scaling consensus computers for over-sized knowledge graphs. The third problem is the lack of quality amongst such knowledge graphs. They will be prone to various surface attacks, such as: sybil attacks, and the selfish behaviour of the interacting agents. In this document, we define a protocol for provable consensus computing of relevance, between IPFS objects, which are based on the Tendermint consensus of cyber~rank, which is itself - computed on GPUs in consensus. As proof-of-stake consensus does not help with the initial distribution, we outline the design for ecologic distribution games. We believe that a minimalistic architecture of the protocol is critical for the formation of a network of domain-specific knowledge consensus computers. As a result of our work, some applications never to have existed before - will emerge. We expand this work with our vision of possible features and potential applications.
@xhipster and @litvintech