Explore >> Select a destination
|
You are here 
|
rjlipton.com | ||
| | | | |
jdh.hamkins.org
|
|
| | | | | I'd like to share a simple proof I've discovered recently of a surprising fact: there is a universal algorithm, capable of computing any given function! Wait, what? What on earth do I ... | |
| | | | |
xorshammer.com
|
|
| | | | | Let $latex \mathrm{PA}$ be Peano Arithmetic. Gödel's Second Incompleteness Theorem says that no consistent theory $latex T$ extending $latex \mathrm{PA}$ can prove its own consistency. (I'll write $latex \mathrm{Con}(T)$ for the statement asserting $latex T$'s consistency; more on this later.) In particular, $latex \mathrm{PA} + \mathrm{Con}(\mathrm{PA})$ is stronger than $latex \mathrm{PA}$. But certainly, given that... | |
| | | | |
dvt.name
|
|
| | | | | In the previous blog post in this series, we looked at Gödel's First Incompleteness Theorem, and came to the amazing conclusion that we can't compute certain kinds of functions in formal systems (like Javascript). Specifically, we looked at a special function, , which turned out to be non-computable. In case we forgot, the first incompleteness ... | |
| | | | |
blog.quarkslab.com
|
|
| | | The Tari Labs mandated Quarkslab to perform a cryptographic and security assessment of the dalek libraries. One of the Tari Labs' projects is to implement the Tari protocol, a decentralised assets protocol. It relies on some of the dalek libraries, especially the cryptographic primitives, provided by subtle and curve25519-dalek. Moreover, the use of Bulletproofs [6], and its implementation by the authors of the dalek libraries, will allow them to enable efficient confidential transactions on the blockchain in a near future. We only found some minor issues. We also provided recommendations on the usage of the libraries and third-party libraries. | ||
