• Popperian fallibilism vs Bayesian justificationism: a deep dive into Karl Popper’s view that ideas are never finally falsified but only iteratively improved through error-correction, contrasted with Bayesian approaches; recommended reading is Bryan Magee’s short Popper book and the site fallibleideas.com.

• Decision-theory taxonomy: participants clarified the rationalist notion of “choosing the thoughts you would have regardless of context” as Eliezer Yudkowsky’s Timeless Decision Theory (TDT) and Wei Dai’s Updateless Decision Theory (UDT), both aimed at making choices invariant across time or observer-moments.

• Cryonics horizon: once high-fidelity brain scanning or emulation becomes feasible, most cryobiology may become obsolete except for biological transport (e.g., terraforming), though historical precedent suggests old technologies rarely vanish completely.

• Long-term cryostasis risks: Mike Darwin is cited on cumulative radiation-induced free-radical chain reactions and the finite half-life of biological macromolecules like polymerases, raising doubts about the ultimate viability of decades-long cryopreservation.

• Verifiable computing as post-Snowden security strategy: participants argue that verified compilers, microkernels, and CPUs are the only scalable path to trustworthy systems, despite current ~10,000× performance penalties; the 31c3 talk “Why are computers so @#!*, and what can we do about it?” (https://www.youtube.com/watch?v=ca0DWaV9uNc) is recommended as an accessible introduction.

• Proving upload authenticity: cryptographic techniques—PGP signatures, multi-party computation, obfuscated/garbled circuits, and distributed verification across independent cloud providers—are proposed to demonstrate that an emulated mind is faithfully executing.

• Development philosophy clash: an ongoing debate pits rapid, duck-typed Python development against strongly-typed, formally-verified languages like Haskell and Rust, with some insisting the latter are essential for trustworthy systems while others defend the pragmatism of quick, simple code.