A practical look at using tower as the middleware layer for Rust AWS Lambda functions, with examples that build up to a DynamoDB-backed per-IP rate limiter. It covers Service, Layer, stack ordering, short-circuiting, boxed async futures, and testing middleware without deploying a Lambda. Comments
Comments
I shipped gni-compression to npm two days ago. One of the first questions I got (from myself, running benchmarks at midnight): does it work on anything other than chat data? Short answer: not yet. Long answer: I found out exactly why, and it led me somewhere more interesting than I expected. After the npm launch I ran GN against Silesia — the standard general text compression benchmark suite. Dick
A hands-on dev review focused on i18n, date/number formatting, and non-ASCII edge cases. Why I Tested TestSprite for Locale Handling Specifically Most AI testing tools get reviewed for their core functionality — does it find bugs, does it write good test code, does it integrate with CI/CD. Those reviews exist. What I couldn't find was a focused review on how TestSprite handles locale-specific edge
Introduction Picture two doctors updating the same patient record at the same time - one in São Paulo, the other in London. Both are offline. When connectivity returns, whose changes prevail? This is not a hypothetical. It is the everyday reality of distributed systems: multiple nodes, no shared clock, no guaranteed network. The conventional answer has long been locking - one node waits while an
I keep seeing the same argument about AI making us dumber. It's the same argument people had about search engines, and before that books. The usual response is to point at history and say "every generation panics, every generation was wrong, relax." I think that response is half right, and the wrong half is what bothers me. Tools change what we bother to remember. The people who'd trained their wh
A few years ago I solved 200 LeetCode problems and still froze on Mediums I hadn't seen. The breakthrough wasn't another hundred problems. It was a different loop. A problem asks for the longest substring with at most K distinct characters. You've solved sliding window before. Maximum sum subarray of size K, done. Longest substring without repeating characters, done. This third one stalls you. Twe