18:30: Pizza is served
19:00: First talk starts
19:45: Second talk starts
Talk #1: Succinct proofs for scaling computation on the blockchain
Verifying block transactions is computationally intensive and creates a throughput bottleneck for blockchain nodes. One area of active research in blockchain scalability is verifiable computation: this is where heavy computations are outsourced to a third-party, yet can still be verified remotely by a light client with limited resources. It works by requiring third-parties to produce succinct proofs of their computations: "succinct" because they can be verified using only a fraction of the proving time. We will explore two constructions, "Rollup" and "Rollup Non-Custodial", which use SNARKs (succinct non-interactive arguments of knowledge) to verifiably outsource computation on the blockchain.
Ying Tong is a Physics graduate student at NUS. She also works as a researcher at the Centre for Quantum Technologies and the Ethereum Foundation. She's interested in cryptography, p2p and privacy.
Talk #2: Reproduction of Images in Source with Minimal Tokens
Uriel is a Year 2 Computer Science student in NUS. He is interested in algorithms/embedded systems/human-computer interaction and also does some hardware projects in his free time.
Free pizza is served before the talks.
Supported by The HANGAR by NUS Enterprise — the campus hub for entrepreneurs