3.18 What are Reach’s limitations?
Today, Reach is a powerful language for building decentralized applications, as demonstrated in the overview, the tutorial, and the workshop series.
However, it has a lot of potential for growth.
This section describes a few of these areas and gives brief sketches of our roadmap for directing this growth.
We welcome your contributions on GitHub and in the Discord community to help bring these plans to fruition.
Foremost, Reach is a consensus network
-agnostic language, so one of our highest priorities is supporting a wide variety of platforms, including layer-2 abstractions over other layer-1 networks.
Presently, we have a robust Ethereum backend
and Algorand backend
Presently, Reach has a robust backend
However, we believe that many decentralized application developers would like to make use of languages like Go and Rust for their participants.
Presently, this can be accomplished via the RPC server
, but we’d like to build a dedicated backend for languages like these.
, free-form objects, destructuring bindings, robust
specificiers, and so on.
However, there are some differences that represent limitations, such as the inability to use functions as values at runtime and the need to enforce finite limits on data.
Verification. Reach’s verifier is robust in the face of many complex and interesting theorems about decentralized application behavior, but it is inherently conservative and does not presently allow users to manually prove theorems that are conservatively rejected.
Since Reach is consensus network
-agnostic, it is not possible for Reach programs to directly integrate with network-specific features, such as observing the blockhash on Ethereum.
Reach programs can instead interact with these low-level details of their chosen consensus network via remote object
Reach’s communication language has some limitations that we have plans to remove, which are discussed in roadmap
, but there are some for which we do not have plans to remove.
For example, we do not intend to support co-inductive or cyclic state, nor expose an arbitrary consensus heap to programmers.