Chaitin’s constant or Omega number #
“In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number) or halting probability is a real number that, informally speaking, represents the probability that a randomly constructed program will halt. These numbers are formed from a construction due to Gregory Chaitin.
…
Each halting probability is a normal and transcendental real number that is not computable, which means that there is no algorithm to compute its digits.
…
Because many outstanding problems in number theory, such as Goldbach’s conjecture, are equivalent to solving the halting problem for special programs (which would basically search for counter-examples and halt if one is found), knowing enough bits of Chaitin’s constant would also imply knowing the answer to these problems. But as the halting problem is not generally solvable, and therefore calculating any but the first few bits of Chaitin’s constant is not possible for a universal language.”
So, if you could get a few (a lot) of its first digits we could solve a lot of problems - I would consider it as an example of Revelation.
“Revelation, or divine revelation, is the disclosing of some form of truth or knowledge through communication with a deity (god) or other supernatural entity or entities in the view of religion and theology.”