Software for people, systems, and the recurring problems between them. Some of these are public demonstrations; others are earlier experiments. Here’s what each is trying to do.
01 / Interactive demonstrationReact · TypeScript
Hiring Capacity Lab
What happens when hiring demand outruns the team’s ability to deliver?
A small operating model that makes demand, throughput, and backlog visible together. Change monthly demand, recruiting throughput, the starting queue, or the planning horizon and see how the queue develops.
A scenario, not a forecast
Start with 24 roles in the queue. Request 12 and complete 7 each month. After six months, the model shows 54 roles waiting. Change the inputs and the result changes with them.
Every figure and organization label is synthetic, created for this public demonstration. No employer records or real performance results are represented.
Put a model inside an interface that already exists.
An early experiment connecting a language model to iMessage. The repository describes a Python process that reads a selected conversation, generates a response, asks for approval by default, then uses AppleScript to send it.
The interesting boundary is separating a generated draft from the decision to send it.
A historical prototype, not a supported messaging product or a guarantee of compatibility with current services. Public source is available; there is no live demo.
The data is there. The destination wants a different shape.
A command-line utility for a specific Lever-style import layout. It combines names and locations, carries selected contact fields across, and generates a profile identifier and timestamp for each output row.
A little translation layer for a task that shouldn’t require rearranging a spreadsheet by hand.
The mapping is specific to this repository—not a universal CSV cleaner or a current vendor-compatibility guarantee. The example uses fictional input values.
Try a possibility. Respect the constraints. Undo when it fails.
A compact recursive solver. It finds an empty cell, tries the digits 1 through 9, checks the row, column, and 3×3 box, then continues. When a branch fails, it clears the choice and tries another.
A small, concrete example of searching a space without keeping a decision that breaks the rules.
