Theo Diamandis (@theo_diamandis) on X (original) (raw)

• Pinned
  
  Just finished teaching a 4 week convex optimization course during MIT's IAP. All lecture notes are available online.convex.csail.mit.edu
• 
• 
• 
  I hear some of you like routing, so I'm excited to share something
  @angeris
  and I hacked together!
• 
  What do optimal power flow, wireless network resource allocation, market clearing, and exchange order routing all have in common? These are all convex flow problems that can be solved very quickly! (New paper with
  @angeris
  and Alan Edelman)
• 
• 
• 
  Frantically googling “how to erase commit history” before my repo goes public
• 
  Have been working on network flows which led me down a rabbit hole tracing the history of the max flow problem. The original formulation of this problem wasn’t declassified until 1999 (!), almost 45 years after its formulation
• 
  This didn't make it onto the cvx exam, so
  @angeris
  and I are putting it here for your mathematical pleasure
• 
  At Devcon, I claimed that we've barely explored the design space of CFMMs (although we’ve seen lots of forks and Rube Goldberg machines)
• 
  Do Marxists ultimately invent surge pricing? Kantorovich's efforts to plan an economy quickly led him to dynamic pricing for resource allocation.
• 
• 
  I talked at CCE today about wtf EIP-1559 (& 4844) is actually doing and how to reason about base fee update rules.