0x0d5 StarJade-Park

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.

Using Git Commit Message Templates to Write Better Commit Messages

The always enthusiastic and knowledgeable mr. @jasaltvik shared with our team an article on writing (good) Git commit messages: How to Write a Git Commit Message. This excellent article explains why good Git commit messages are important, and explains what constitutes a good commit message. I wholeheartedly agree with what @cbeams writes in his article. (Have you read it yet? If not, go read it now. I'll wait.) It's sensible stuff. So I decided to start following the

NAVER DEVIEW 2017 Slides

키노트 영상

DAY 1

문자열 인코딩에 대해서...

문자 코드는 우리가 표현하고자 하는 문자들의 집합을 코드화시킨 것이고, 문자열 인코딩은 그러한 문자 코드의 배열을 메모리상에 표현하는 방법입니다.

문자 코드	인코딩
아스키 코드	iso 8859

	---
	Language: Cpp
	AccessModifierOffset: -4
	AlignAfterOpenBracket: DontAlign
	AlignConsecutiveAssignments: false
	AlignConsecutiveDeclarations: false
	AlignEscapedNewlines: Left
	AlignOperands: true
	AlignTrailingComments: true
	AllowAllParametersOfDeclarationOnNextLine: true

	#include <stdio.h>
	#include <iostream>
	#include <stack>
	#include <cstring>
	#include <queue>

	#define ll long long int
	#define MAX(a,b) (a)>(b)?(a):(b)
	#define MIN(a,b) (a)>(b)?(b):(a)
	#define pii pair<int , int>

	#include <stdio.h>
	#include <iostream>
	#include <stack>
	#include <cstring>

	#define ll long long int
	#define MAX(a,b) (a)>(b)?(a):(b)
	#define MIN(a,b) (a)>(b)?(b):(a)

	using namespace std;

	#include <stdio.h>
	#include <iostream>
	#include <stack>
	#include <cstring>

	#define ll long long int
	#define MAX(a,b) (a)>(b)?(a):(b)
	#define MIN(a,b) (a)>(b)?(b):(a)
	#define pii pair<int , int>
	#define time first

	#include <stdio.h>
	#include <iostream>
	#include <stack>
	#include <cstring>
	#include <queue>

	#define ll long long int
	#define MAX(a,b) (a)>(b)?(a):(b)
	#define MIN(a,b) (a)>(b)?(b):(a)
	#define pii pair<int , int>


	git log --author="Linus Torvalds" --date=iso \| perl -nalE 'if (/^Date:\s+[\d-]{10}\s(\d{2})/) { say $1+0 }' \| sort \| uniq -c\|perl -MList::Util=max -nalE '$h{$F[1]} = $F[0]; }{ $m = max values %h; foreach (0..23) { $h{$_} = 0 if not exists $h{$_} } foreach (sort {$a <=> $b } keys %h) { say sprintf "%02d - %4d %s", $_, $h{$_}, ""x ($h{$_} / $m 50); }'