Dealing With Complexity in the Blockchain and Beyond
summary
Describes building a Tenderly debugger that actually runs by matched compiled bytecode to source using incremental heuristics that detect jumps, function calls and loops, backed by printed bytecode traces and whiteboard pattern matching; explains concrete problem techniques — blackboxing, subdividing, simplifying and perspective shifts — and shows a solved math case where four random points in a ball contain the center with probability 1/8, with the 2D triangle analogue equal to 1/4.
AI-written summary · about
chapters (6)
- 0:00Introduction to the talk
- 0:49What are difficult problems
- 9:05Methods to solve difficult problems
- 27:10Why blockchain needs problem solvers
- 30:23Solving a complex math problem
- 37:38Closing and resources
related talks
01h 02mBlockchain is Cyberpunk
01h 16m“Developing Blockchain Software”
15mThinking Hard is not Enough
39mOnce Upon a Bytecode: Analysis Tools
14mShall we Explore the Blockchain Maze?
43mSolving Blockchain’s Interoperability Challenges
36mDecrypting Tech Hype for the Busy Coder
34mBlockchain, Ethereum and Business Applications