Isaac DeFrain, Technical Writer
Isaac is a mathematician, educator, technical consultant, and blockchain and decentralization enthusiast. He received his M.A. in mathematics from Kent State University and has studied a broad range of topics from complex analysis to discrete geometry to cryptography. He is also an avid rock climber, ninja, juggler, whole foods plant-based eater, and a compulsive learner.
His favorite part about blockchain technology is that it gives us a more secure and sustainable peer-to-peer network for doing transactions of all kinds and ultimately, empowers the individual. This notion is so compelling and far-reaching that it may take several years for the world to realize the full extent of this technology. Isaac strongly believes that RChain is the secure, scalable, and sustainable blockchain solution the world has been waiting for and he is incredibly excited to work with the co-op and add as much value as possible.
Posts by Isaac
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.
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.
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.