Euclid could show that his GCD algorithm would not always halt for any two lines that he could draw. But we still have a concrete representation of the irrational quantity in the diagonal of a square. https://en.wikipedia.org/wiki/Euclidean_algorithm
en.wikipedia.org Euclidean algorithm - Wikipedia Actually draw a diagonal on a square, and you will see that, in fact, the diagonal is composed of a finite, countable number of points.
Euclidean geometry mistakenly assumes that space is continuous. With discrete space, there is no incommensurability.
Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.
1Jj8TsZnm1bosAJFjkbS8J2MckEGx6sGot Verified