Discover the Rchain Cooperative
n this second and final part, we will explore two variants of the operational semantics for ρ-calculus. These variants turn out to be more suitable for modeling biological and physical phenomena than the π-calculus or ambient calculus. The first variant deals with process annihilation, which is a relationship between processes reminiscent of matter/antimatter annihilation. The second variant deals with contextualized communication and allows for ease of communicating between different protocol layers.
Pure ρ-calculus is an elegant, abstract, minimal model for asynchronous, concurrent computation. It was designed to be useful, powerful, and efficient, but not necessarily “user-friendly.” As is, it does not provide a robust programming language. This can be easily remedied by injecting names. This is how Rholang was born.
We speak with two of the leading software engineers working on the CBC Casper framework and its implementation in RChain, Michael Birch and Kent Shikama. In this conversation at RCon3, we discuss everything from blockDAGs to the GHOST fork-choice rule. Below, we give an overview of the topics covered.
Now, we will explain program equivalence and operational semantics. We will also discuss the concepts of monoids and monads and their connection to computational calculi.
With blockchain, there is no need for a centralized source. Computers are connected to a network that provides all accounting for everyone on the chain. If one computer fails, the others serve as backups. All computers connected to the network aid in the development of a communal public-facing ledger. If one fails, the others pick up the slack. Instead of double-entry bookkeeping, blockchain is just X-entry bookkeeping, where X equals the numbers of nodes on the chain.
Intro to Design of Computational Calculi 2: Names, compilable programs, and equivalence of processes
We discuss the role of names and binding and the different notions of equivalence in our examples of computational calculi. Keeping in mind that the goal of these lectures is to be able to design computational calculi with desired properties, we discuss these ideas generally, yet within the framework of our examples.
The variety of disposable electronics (Internet-of-Things, IoT) has grown substantially over the last decade, as prices are falling, and the selection becomes incredibly powerful. Blockchains typically require significant storage and processing resources for all of the cryptography used in the transactions they store