@damian_b Can't dm :( but would love to showcase my skills: https://t.co/R16MEndaUo
In short:
- Research on a (patented) Elastic Circuit Breaker for Shopify (Semian)
- Research on formal verification of Kubernetes controllers
- Contributions to numerous open-source PL/systems projects
"What math means to me" (by Larry Guth): https://t.co/MRWI4sai96
"This is a personal essay about how I see math, what I value about it, and what it means to me."
@ZenanLii Great work! Now that GPU kernels can be written in native Rust, have you experimented with Rust verification tool chains like Verus but on the GPU?
When agents move from thinking to doing, everyone is excited about the future of #AI.
When I see students doing without thinking, I get concerned about the future of humanity.
With over 60,000 submissions to #ICLR2027, how many are the results of deep thinking from authors?
100 TB of RAM, saved by shrinking a consistent hash ring. The last 90,000 hashes per server were buying 0.7% load balance improvement. Math said stop. We stopped.
https://t.co/76XojaaDQG
Most people treat a zero-failure record as a flex. In computer science, there is a sharper perspective famously known as "Umeshisms."
During his PhD at UC Berkeley under quantum computing pioneer Umesh Vazirani, computer scientist Scott Aaronson noted an aphorism his advisor loved to repeat:
"If you have never missed a flight, you are spending too much time in airports."
The math logic is simple: a 0% miss rate often means you are overpaying in friction, prep time, and missed opportunity. Occasional failure is often the price of a better expected-value tradeoff.
Aaronson named these "Umeshisms" in a 2005 blog post and penned a few sequels in the same spirit:
- "If you have never been rejected, you are not asking enough."
- "If you never cut yourself while shaving, you are not shaving close enough."
The lesson is recognizing when extreme risk aversion costs you more than the risk itself.
NVIDIA's OpenShell uses the Z3 theorem prover to verify agent actions. When denying a path, it returns the exact constraint adjustment needed.
Binary guardrails just halt the loop. Returning structured counterexamples turns a block into a solvable recovery step.
https://t.co/gFSTeSW22j
I've written 70+ recommendation letters for students applying graduate programs in my career. This is the saddest one I have to redo.
// A former undergrad student got denial of entrance with a 5-year ban, when flying to the US for PhD study. As usual, no reason was given. I can't imagine what he have gone through.
@mijovic988 Are there any open source efforts I could help with? I have experience with Rocq and Verus, but have wanted to try formal methods applied to contracts!