(More information including videos is linked at tauchain.org)
Tau-chain is a fully decentralized P2P network being a generalization of many centralized and decentralized P2P networks, including the Blockchain.
We aim to generalize the concept as much as we find, and give users the ability to implement virtually any P2P network over tau-chain.
Its interpretations, uses, and consequences are far from being a P2P network only, and include software development, legal, gaming, mathematics and sciences, logic, crypto-economies, social networks, rule-making, democracy and votes, software repositories (like decentralized Github+Appstore/Google Play), decentralized storage, software approval and verification, even “doing your homework in History or Math” in some sense (stronger sense that search engines), and many more aspects.
We propose taking the language of Ontologies to unify languages of:
Ontologies are expressed in RDF language family (Resource Description Framework), or simply NTriples, NQuads, Notation3 or JSON-LD.
We propose a software client that stores an ontology of local rules, and determines its actions using a Reasoner. Reasoners are tools that infer new rules or conclusions given old ones. They do it intelligently - using pure logical reasoning, and they also supply proofs for their results. Tauchain node is therefore an intelligent agent able to communicate with other agents, at the very same language they're written with, which is quite human-readable.
A reasoner with networking builtins can run practically any computer program, like HTTP server, once implemented in RDF.
Arrow of time is brought into the network using the Blockchain algorithm. Items can get into a Merkle tree that will be signed by a miner, roughly speaking. The network will also function an RDF-speaking distributed storage, namely Kademlia DHT, letting hashes of items to be time-stamped in a mechanism which is up to the rules.
The rules of the network are determined by its users. Conversely, many independent universes can be created over tau-chain, that may or may not share tau's timestamping. They can also reference to each other, allowing code-reuse: recall that rules are code, since we have a unified language. Moreover: we give an ability to implement Decidable computer programs with RDF, namely DTLC languages rather Turing Complete ones. The implications of those languages will be described on the paper.