serialhex

LLM Wiki

A pattern for building personal knowledge bases using LLMs.

This is an idea file, it is designed to be copy pasted to your own LLM Agent (e.g. OpenAI Codex, Claude Code, OpenCode / Pi, or etc.). Its goal is to communicate the high level idea, but your agent will build out the specifics in collaboration with you.

The core idea

Most people's experience with LLMs and documents looks like RAG: you upload a collection of files, the LLM retrieves relevant chunks at query time, and generates an answer. This works, but the LLM is rediscovering knowledge from scratch on every question. There's no accumulation. Ask a subtle question that requires synthesizing five documents, and the LLM has to find and piece together the relevant fragments every time. Nothing is built up. NotebookLM, ChatGPT file uploads, and most RAG systems work this way.

Alternative to the Church, Scott and Parigot encodings of data on the Lambda Calculus.

When it comes to encoding data on the pure λ-calculus (without complex extensions such as ADTs), there are 3 widely used approaches.

Church Encoding

The Church Encoding, which represents data structures as their folds. Using Caramel’s syntax, the natural number 3 is, for example. represented as:

0 c0 = (f x -> x)
1 c1 = (f x -> (f x))
2 c2 = (f x -&gt; (f (f x)))

Looking at the most beautiful program ever written - part 1

I am going to have a look at what William Byrd presented as The most beautiful program ever written.

Beauty here refers to computer programs, specifically about Lisp. There might be errors as this is something I wrote to make sense of that interpreter, proceed at your own risk.

Thanks a lot to Carl J. Factora for the help.

	/* Heap based virtual machine described in section 3.4 of Three Implementation Models for Scheme, Dybvig
	*/

	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>
	#include <ctype.h>
	#include <assert.h>

	char token[128][32];

	#pragma once

	#define DYN_ARR_OF(type) struct { \
	type *data; \
	type *endptr; \
	uint32_t capacity; \
	}

	#if !defined(__cplusplus)
	#define decltype(x) void*

	; A MICRO-MANUAL FOR LISP - NOT THE WHOLE TRUTH, 1978
	; John McCarthy, Artificial Intelligence Laboratory, Stanford University

	; https://www.ee.ryerson.ca/~elf/pub/misc/micromanualLISP.pdf
	; https://github.com/jaseemabid/micromanual

	; for CL : Rainer Joswig, joswig@lisp.de

	; this version runs in a Common Lisp

	;; {}: Map literal like Clojure

	;; Note:
	;; 1. Equality operator is #'eql.
	;; 2. {} is a literal here though it is a constructor in Clojure:
	;; Clojure:
	;; (:b {:a 1 :b (+ 1 2)}) => 3
	;; CL:
	;; (gethash :b {:a 1 :b (+ 1 2)}) => (+ 1 2)

	/* file: "tinyc.c" */
	/* originally from http://www.iro.umontreal.ca/~felipe/IFT2030-Automne2002/Complements/tinyc.c */

	/* Copyright (C) 2001 by Marc Feeley, All Rights Reserved. */

	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>

	/*

	(ns simple-compojure.core
	(require
	[ring.adapter.jetty :refer [run-jetty]]
	[ring.middleware.params :as p]
	[simple-compojure.middleware :as m]
	[simple-compojure.routes :as r]
	))

	(def app
	(-> r/routes