Information Density: Frontiers – Signal Evidence & AI Readability

[H2] Requests for theories
Phenomena observed in nature or experiment, but not yet understood well enough to reproduce or control.
[H3] Why do copper oxides superconduct at high temperatures?
Some copper oxides, known as cuprates, superconduct at unusually high temperatures (up to roughly 134 K, -139 °C, -219 °F) at ambient pressure.Cuprate superconductivity was discovered unexpectedly in 1986.BCS theory does not explain the effect, and there is still no consensus explanation for it.
[H3] Why can some animals regenerate body parts or entire bodies?
Some animals can regenerate complex structures after injury. Salamanders can regrow entire limbs, zebrafish can regrow fins and parts of the heart, and planarian flatworms can regenerate whole bodies from small fragments.Animal regeneration has been documented since antiquity.Existing theories do not fully explain how animals know what is missing, rebuild the right tissues in the right places, and stop once the missing structure has been restored.A theory of regeneration would need to explain where the target shape is stored, how large-scale outcomes like regrowing limbs or organs could be controlled, and how regeneration relates to morphogenesis.
[H2] Requests for cures
Common conditions with major quality-of-life effects and no general cure.
[H3] Tinnitus
About 14% of adults globally have experienced tinnitus, and almost 10% have experienced chronic tinnitus lasting more than three months. For some people, it persists indefinitely.There is no general cure, and causes can vary widely, including hearing damage, loud-noise exposure, jaw or neck tension, and neurological changes.Current options are limited and usually focus on coping with the sound rather than eliminating it.For a broader map of unmet medical needs, including rare conditions, see Convoke's Unmet Needs Index.
[H2] Requests for step changes
Technologies that already work, but still have room for order-of-magnitude improvement.
[H3] Verifiable computation
Reduce the cost and time required to generate proofs that a computation was performed correctly.The premise is simple: given a known input, a known program, and a claimed output, produce a proof that the output is correct. Where homomorphic encryption and zero-knowledge proofs are about hiding information from some party, verifiable computation is simply about proving correctness.A proof system can be judged by three things: how expensive the proof is to generate, how large the proof is, and how expensive the proof is to verify.Proofs can already be compact and fast to verify, but generating them for arbitrary computations remains far slower than simply running the computation.Cheap proof generation would let computational outputs carry certificates of correctness, making outsourced computation, computation markets, and long-lived computational results viable.Trusted execution environments are a practical stand-in today, but they rely fully on trust in the underlying hardware.For more frontiers related to computation and cryptography, see 0xPARC.