andrew

Independent programmer

INITIALIZING

/home/andrew

hi, i’m andrew.

I write code to figure things out.
Mostly Rust, C++, and Python.

Lately: small worlds, distributed systems, and AI.

z ← |z| / clamp(z · z, 0.12, 4) − (0.79, 0.57) I(x,y,t) = 𝟙[f(z,t) > B₄(x,y)]

Ordered 1-bit study of a folded recursive field forming concentric filaments. Live ordered 1-bit recursive field visualization.
01 / recursive field move your cursor

Boston / Cambridge

a few things below

01

a few projects.

01 / Civilization Agent Sandbox

ARES

A small world for AI agents. They suggest a move; Rust checks it before the world changes. Every state change is deterministic and atomic.

private repo / in progress
notes — ARES
  1. 01
    Bounded proposal

    Complete six-part allocation plus the expected base tick.

  2. 02
    Rust validates

    Build a candidate state, then check every invariant.

  3. 03
    Commit or reject

    S(0) becomes S(1) once; rejection leaves state untouched.

Rust / Cargo / 3 crates / Atomic commit / Frontier v0.1

a small world, one tick at a time

02 / Distributed Compute Control Plane

Rust Edge Compute Node

A Rust control plane for a small compute cluster. I’m interested in what happens when a worker disappears.

notes — Rust Edge Compute Node
  1. 01
    Workers report

    GPU telemetry, uptime, version, and heartbeat state.

  2. 02
    Orchestrator leases

    Capability filter, priority queue, and renewable job lease.

  3. 03
    Failure recovers

    Stale nodes are evicted and expired work returns to the queue.

Rust / Tokio / Tonic / gRPC / Ratatui

connections that find another way

03 / Particle Simulation

High-Performance Physics Engine

An excuse to learn what makes a simulation fast. C++17, Verlet integration, and particle collisions. Spatial hashing and benchmarks are next.

notes — High-Performance Physics Engine
  1. 01
    Integrate

    Current and previous positions advance through Verlet steps.

  2. 02
    Resolve

    Boundary bounces and all-pairs particle contacts on CPU.

  3. 03
    Render + measure

    SFML frame output with FPS and particle diagnostics.

C++17 / CMake / SFML / Verlet / O(n²) contacts

particles, constraints, and a lot of debugging

04 / Speculative Decoding Gateway

Speculative Inference Proxy

I’m testing whether speculative decoding is worth the extra machinery. This proxy compares both paths and measures the wait.

notes — Speculative Inference Proxy
  1. 01
    Route

    One request selects the baseline or speculation-enabled arm.

  2. 02
    Engine owns speculation

    Draft proposal and target verification stay inside vLLM.

  3. 03
    Stream + measure

    Pass SSE through while recording first output and total latency.

Rust / Axum / vLLM / SSE / OpenMetrics

two paths, one measured stream

usually within reach.

01

Systems programming

  • Rust
  • C++
  • Linux
  • Bash
  • Tokio

02

AI infrastructure

  • Python
  • PyTorch
  • vLLM
  • FastAPI
  • Eval Harnesses

03

Distributed infrastructure

  • Docker
  • gRPC
  • Tonic
  • GitHub Actions

04

Security labs

  • Hack The Box
  • Web Security
  • Prompt Injection
  • Threat Modeling

05

Interfaces

  • TypeScript
  • React
  • MapLibre
  • Dashboards
FIELD / 01 03 WORK SCROLL TO ENTER

contact.txt

A curious resident process follows the typing and your cursor.
contact.txt

cat contact.txt

hey. you found me.

# say hi. strange links welcome.