Five questions
driving our work.

Skelf Research is an independent UK AI research lab organised around five research pillars. Each pillar has a defining research question, a set of methods, and current public software. The portfolio contains 19 public repositories; 18 carry a detected OSS licence.

01

LLM Cognition & Prompt Theory

How do we make prompts first-class engineering artefacts?

We study declarative prompt specification, lifecycle management, automatic optimisation, cost-quality routing, and persistent memory for LLM agents. The thesis: prompts deserve the same engineering rigour we apply to source code — explicit types, version control, portability, and reproducibility.

Methods

  • Formal specification languages
  • MIPROv2-based prompt optimisation
  • Cost-quality routing
  • Structured memory schemas
Topics this pillar covers
LLMprompt engineeringagent memorydeclarative promptingprompt specificationMIPROv2LLM routingagent protocolsMCPA2A

02

Safe & Verifiable Computing

What does it take to run AI-generated code safely, in production?

We study memory-safe language design for AI code generators, sandboxing for untrusted execution, NUMA-aware scheduling for memory-bound AI workloads, and embedded databases for AI workflows. The thesis: AI systems cannot be trusted in production without the same systems-engineering rigour we apply to aviation or medical software.

Methods

  • Memory-safe language design
  • Capability-based sandboxing
  • NUMA topology awareness
  • Embedded database research
  • ANN vector search
Topics this pillar covers
memory-safe Cmemory-safe systemscode sandboxgVisorFirecrackerWASMNUMANUMA-aware schedulingSQLiteRocksDBvector databaseANNHNSWembedded databaseprogrammable databasemetadata privacyzero-knowledge proofsdifferential privacy

03

Formal Optimisation & Decision Science

Can natural language reliably interface with mathematical solvers?

We study the bridge between human intent and formally provable solutions. We build pipelines that translate English problem descriptions into constraint-satisfaction problems, bandit algorithms that rank items with minimal human feedback, and compilers that turn visual specifications into verified executables. The thesis: pure LLM output cannot guarantee optimality; formal solvers can, and the two should compose.

Methods

  • NL-to-CSP translation
  • Multi-armed bandit algorithms
  • Visual-to-code compilation
  • Formal verification

Projects

Topics this pillar covers
constraint satisfactionSMT solverZ3OR-Toolsmulti-armed banditMAB rankingpairwise comparisonBradley-TerryTrueSkillPlackett-Lucetrading signal compilerquant DSLquantitative tradingsignal compilation

04

Edge Intelligence & On-Device AI

How much intelligence can live at the edge without any cloud dependency?

We study on-device LLM execution, mobile agent architectures, browser-extension LLM frameworks, and deliberative search. The thesis: privacy, latency, and cost constraints are pushing AI out of the data centre, and the engineering to make that work is research-worthy on its own.

Methods

  • On-device LLM inference
  • Mobile agent architectures
  • Quantisation-aware deployment
  • Browser-extension frameworks
  • Deliberative search

Projects

Topics this pillar covers
on-device LLMedge AImobile AIFlutter LLMmobile agentautonomous agentdevice-side AIquantisationQ4Q5GGUFllama.cppbrowser extension AIdeliberative searchagentic search

05

Robotics & Autonomous Systems

How do autonomous agents reason, plan, and coordinate in the physical world?

We study the systems engineering that turns research code into reproducible robotics experiments. The thesis: a robotics benchmark that isn't deterministic isn't a benchmark — it's a marketing demo. We build simulators with byte-identical replay, Gymnasium-style RL interfaces, and instrumented delay attribution usable as a reward signal.

Methods

  • Discrete-event simulation
  • Deterministic RL benchmarks
  • Causal delay attribution
  • Permutation-equivariant policies

Projects

Topics this pillar covers
warehouse roboticsrobotic mobile fulfillment systemRMFSautonomous mobile robotAMRmulti-agent path findingMAPFdiscrete event simulationdeterministic simulationreinforcement learning benchmarkGymnasiumMaskablePPOtask allocationdispatchingKivaAmazon Robotics

Cross-cutting principles

These four principles apply to every pillar.

Open Science

Research artefacts are published for inspection wherever rights, safety, and project maturity allow.

Hypotheses as Software

We publish code that can be run, tested, and challenged. The codebase is the evidence — runnable, testable, falsifiable.

Memory-Safe by Default

We choose Rust, Zig, and Go not for fashion but for falsifiability. Deterministic performance makes systems claims measurable.

Privacy as a Research Constraint

On-device inference and zero-trust architectures aren't add-ons — they're design constraints that shape better science.

From question to artefact

A pillar is not a product category. It is a standing question that has not been answered well enough in public, and the projects underneath it are attempts on that question from different angles. Promptel and blogus both sit in the prompt-theory pillar and share almost no code, because specification and lifecycle are separate problems that happen to be about the same artefact.

Work enters a pillar through the same short pipeline each time. The question is written down in a form that could be wrong. A repository is built with a runnable entry point and an explicit statement of what it does not attempt. The artefact is then run against a workload it was not designed for, which is where most of the interesting failures come from. Whatever that produces is written up, including when the answer is unhelpful — a pillar with only positive results in it is reporting a filtered sample.

Two pillars are deliberately under-populated. Robotics has one project, because a deterministic simulator is a prerequisite for anything else we would want to claim there. Formal optimisation has three, and the honest summary of that thread so far is a negative result: language models translate problem statements into formal encodings competently and cannot be trusted to solve the encodings, which argues for composing them with a solver rather than replacing it.

We also measure whether any of this is reaching the surfaces people now ask. The method, the prompt set and the first results are published in Measuring Whether Answer Engines Cite You, on the same principle as the software: a claim about visibility that cannot be reproduced is a marketing statement, not a finding.

Where to start