This is an exploration of a half-baked idea that won't leave me alone. It's probably naive, definitely incomplete, but I think there's something here worth thinking through together.

A comprehensive guide to building a performant, SEO-friendly blog using Next.js 15, React 19, and Markdown files.

Welcome to my personal blog where I share thoughts on technology, programming, and life.

The FLP Theorem (Fischer, Lynch, and Paterson impossibility theorem) is a foundational result in the field of distributed computing. It was first introduced in 1985 by Fischer, Lynch, and Paterson. The theorem, often simply referred to as the FLP impossibility, addresses the problem of reaching consensus in distributed systems, particularly under asynchronous conditions where process failures are possible.

When I first heard about Bancor raising $153 million in just three hours on June 12, 2017, I knew I was witnessing history. Not because of the amount—though it was staggering—but because of what it represented: the moment when smart contracts proved they could revolutionize fundraising forever. Today, I want to take you through the technical brilliance and human drama behind Initial Coin Offerings, using Bancor as our lens to understand how a few hundred lines of code changed venture capital forever.