Reach’s big claim to fame (other than that they’re endeavoring to be a cross-platform blockchain solution) is that their compiler does a great deal of theorem-proving, in order to avoid producing anything that could cause tokens to vanish irretrievably into a proverbial black hole.
Are there any similar failsafes for PyTeal, Beaker, or AlgoKit?
Also, does anybody know anything about using Reach-generated TEAL with dappflow?
(Note that the last time I did anything with Reach, it was the Trust Fund workshop, and for some reason, it was categorically refusing to behave “as advertised,” at least running on an Algorand DevNet, with the trial that theoretically should return the “Monopoly-Algos” to the Funder instead giving them to the “Bystander.” Not just for me, but for others, and not just for my solution but for the canned solution, and nobody seemed to be in any hurry to do anything about it. And one look at the TEAL code put me into “deer in headlights” mode.)
