Discover the Rchain Cooperative
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
In an interview with Epicenter, Greg Meredith and Nash Foster broke down one of the key things that makes Rholang unique where other languages are lacking due to what can be called a syntax-semantics gap. Nash explained that the simplicity of some languages is deceptive. “You can stand something up and it will sort of work, but you’re going to have a lot of bugs because you don't really understand what you’re doing. The model of computation is too confusing.
This talk from RCon3 covers RChain’s use of the CBC Casper framework and the proof of stake protocol built on Casper. The video includes images and explanations of a blockDAG and what equivocation looks like.
Rholang is frequently touted as a fully concurrent programming language. It will be blazing fast because it executes things sequentially only when absolutely necessary. It allows us to avoid resource starvations and thread deadlock. And it isn't even clunky or hard to use, because all of this is built right into its concurrent computational model.
On September 5th, validators from around the world convened in Berlin, Germany to launch the test net. More precisely, they launched the first of several test nets that will be run between now and early 2019 when the "Mercury" main net launches.
To design computational calculi for specific applications, we must first understand what constitutes a computational calculus. The RhoVM is based on the concurrent computational calculus known as reflective, higher-order calculus, or ρ-calculus for short.
The ρ-calculus is an asynchronous message-passing calculus built on a notion of quoting; it is a closed theory, as the theory of names is wholly determined by the theory of processes. The name ρ-calculus or RHO-calculus is an acronym for reflective, higher-order calculus.