Technical notes

What is underneath: code, numbers and failures, written for whoever has to build it.

Fourteen long notes in two series. Each carries the schema, the query or the formula that was used, the numbers with their assumptions, and the failure-modes section the home page leaves out.

Applied AI · the engineering behind the six

06

The home page says what a company can ask for. These notes say what runs, what it is made of, what it costs and how it is measured — with the code.

N.01

Scoring where a model belongs: a use-case ledger with a cost per case and a risk class

A department walk-through becomes a ranked ledger of AI use cases, each with a measured baseline, a cost per run and per error, a data-readiness level and an EU AI Act class.

use-case scoring · cost model · EU AI Act
10 min
N.02

What a non-technical team actually has to understand about a language model

The mechanical facts a non-technical team needs about a language model, plus four checks, four data classes, a versioned prompt library and a benchmark that shows whether it took.

AI literacy · data classification · prompt library
10 min
N.03

Hybrid retrieval that returns the paragraph, not a paraphrase

Structure-aware chunks, BM25 plus pgvector fused by reciprocal rank, a cross-encoder reranker, and an answer model that must cite the passage id or abstain, all measured on a versioned question set.

hybrid retrieval · citations · evaluation sets
9 min
N.04

An agent can only do what its tools allow, so design the tools

Agents as a tool-surface problem: typed MCP tools with declared effects, idempotent orchestration with explicit state, human approval gates, an append-only audit log and tests that include the refusals.

agents · MCP · tool design · approval gates
9 min
N.05

Serving open models inside the building: sizing, quantisation and the API shape

Weight and KV-cache arithmetic decide what fits on a card, quantisation buys concurrency, vLLM or Ollama by the queue, and an OpenAI-compatible gateway keeps applications portable.

local inference · quantisation · vLLM
8 min
N.06

The right size of model for the task, decided by a number

The smallest model that clears a task-set bar on a gold set: candidate ladder, cost per thousand runs, LoRA distillation and a calibrated cascade router.

model selection · evaluation · distillation
9 min

Systems · working notes

08

Notes written from the independent systems and the professional practice: measurement, constraints, and where a number stops meaning what it seems to.

N.07

Reconstructing behavioural strategies from public blockchain events

From EVM event logs to positions, windowed features and clusters with a confidence, and the permutation test that decides whether a label is a strategy or noise.

blockchain · behavioural modelling · statistics
9 min
N.08

What “under 100 ms” actually means in an event-execution system

A latency claim only means something once the clock's start and end, the percentile and the transaction's fate afterwards are pinned down and measured separately.

latency · p95 · event execution
9 min
N.09

Building controlled Linux environments for specialised products

A product image is an enumerated set of packages and services built from a definition, booted read-only, updated atomically with rollback, and provable byte for byte.

reproducible images · systemd · A/B updates
11 min
N.10

Legal constraints as engineering inputs

Under MDR, IEC 62304 and ISO 14971, requirements with ids, risk controls, SOUP records and change control become data the build queries, and CI emits the evidence.

medical software · traceability · IEC 62304
9 min
N.11

Designing retrieval systems where the source remains authoritative

Citations as resolvable ids, structured extraction with confidence and provenance, an abstention rule and an engineered review queue: the contract between a retrieval system and its reader.

citations · structured extraction · human review
8 min
N.12

Why a semantic match is not legal eligibility

A similarity score says a call talks about what a company does; eligibility is a conjunction of hard rules evaluated with evidence, and the retriever only proposes candidates.

rule evaluation · CNAE taxonomy · missing-data confidence
7 min
N.13

Meal planning as a constrained optimisation problem

A week of meals modelled as one integer programme in CP-SAT: variables, hard constraints, weighted objectives, a worked instance, and an explanation record built from the same model.

integer programming · CP-SAT · meal planning
10 min
N.14

Why LLMs should not calculate nutritional values

A model's nutrient figure is a likely token, not a measurement; composition tables, weights and yields feed a deterministic layer, and the model may quote only what it returned.

food-composition tables · deterministic arithmetic · schema-constrained output
8 min
← SANIX Written from work described at a high level · no client data