Introduction
The hard series covers advanced TypeScript type system concepts including contravariant inference, template literal recursion, and union manipulation.
Less than 1 minute
Type Challenge Explained
solution and explanation of type challenge
Introduction
The easy series covers fundamental TypeScript type system concepts. Each challenge builds intuition for mapped types, conditional types, and type inference.
Less than 1 minute
Introduction
Due to the large number of medium series questions, in order to facilitate everyone to check, I provide a navigation here for everyone to check.
About 2 min
The kotodama app teaches Japanese through immersion. You walk around a 3D world, interact with objects, and the game teaches you words in context. The world started as procedural colored boxes on a flat green plane. It looked like a dev test scene because it was one.
Then someone said "what if it looked like Animal Crossing?" and we spent three weeks making that happen.
About 5 min
I teach algorithms. The hardest part isn't the math — it's getting students to build intuition for how an algorithm behaves. You can explain red-black tree rotations on a whiteboard, but until someone sees the tree restructure itself in real time, it stays abstract.
So I built 34 interactive algorithm visualizations. In two weeks. Each one is a self-contained HTML file with no dependencies. Dark theme, consistent controls, runs in any browser. The project is visual-cs.
About 5 min
Date: 2026-03-29
Generated by running tsc --noEmit --strict on each solution's first code block combined with the official type-challenges test cases.
Summary
| Category | Count |
|---|---|
| ✅ Passed | 84 |
| ❌ Failed | 36 |
| ⏭ Skipped (no solution / no question dir) | 2 |
| Total checked | 120 |
About 15 min
This project is still under development!
Type Challenges is a project that aims to provide a collection of type challenges with the goal of helping people learn TypeScript.
Less than 1 minute
Today we ran comprehensive benchmarks to measure AVM's impact on multi-agent collaboration. The results demonstrate both where persistent memory provides the most value and where we achieved significant performance optimizations.
TL;DR
Multi-Agent Accuracy:
| Scenario | Baseline | AVM | Improvement |
|---|---|---|---|
| Context Overflow | 50% | 88% | +38% |
| Knowledge Retrieval | 47% | 67% | +20% |
| Full Collaboration | 100% | 100% | — |
About 3 min
AVM was designed with theoretical goals: token-aware retrieval, multi-agent isolation, append-only semantics. But theory without measurement is just speculation. This post presents a rigorous performance evaluation of AVM across multiple dimensions, with the goal of understanding where it excels and where the bottlenecks are.
About 7 min
Today marks a milestone in RedScript development: v2.5.0 ships with a completely redesigned numeric type system, IEEE 754 double-precision arithmetic running inside Minecraft's scoreboard engine, N-order Bézier curves, and a massive stdlib expansion bringing the test suite from 1277 to 1485 cases. Here's what went into this release.
About 4 min