[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M78B010CASQHPNYBP2CP6R2E":3,"skill-same:01M78B010CASQHPNYBP2CP6R2E":93},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":38,"commitSha":39,"skillDirectory":40,"forksCount":14,"repositoryHtmlUrl":41,"repositoryHomepageUrl":6,"ownerHtmlUrl":42,"ownerBlogUrl":6,"ownerDescription":43,"updatedAt":44,"install":45,"resources":58},"01M78B010CASQHPNYBP2CP6R2E","literate-programming",null,"Transform a codebase into a literate program — a .lit.md document written for human comprehension that also generates the original source code via tangling.","abdullibrahim733-pixel\u002FEagle","abdullibrahim733-pixel","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F230504522?v=4","01M787SK0DQR0H1K326DJT6EBK","ibrahim abdull","01M787SK1HWS9V959THKZM6N70",0,"MIT","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: literate-programming\ndescription: Transform a codebase into a literate program — a .lit.md document written for human comprehension that also generates the original source code via tangling.\nversion: 1.0.0\nauthor: Tom Lehman + Hermes Agent\nlicense: MIT\nplatforms: [linux, macos, windows]\nmetadata:\n  hermes:\n    tags: [literate-programming, documentation, pandoc, code-generation, pdf]\n    related_skills: []\n---\n\n# Literate Programming\n\nTransform a codebase into a literate program: a document written for human comprehension that also generates the original source code.\n\n## Overview\n\nA literate program is a single `.lit.md` markdown file that serves as both documentation and source code. It produces two outputs:\n\n- **WEAVE** → A PDF (via Pandoc) with prose, diagrams, math, and syntax-highlighted code.\n- **TANGLE** → The original source files, extracted from named code chunks.\n\nThe prose explains *why* the code exists and how it works. The code is embedded in named chunks that can reference each other. The reader follows a narrative, not a file listing.\n\n## Chunk Syntax\n\nCode blocks become named chunks by adding attributes:\n\n````\n```ts {chunk=\"handle-request\" file=\"src\u002Fserver.ts\"}\n\u003C\u003Cparse-headers>>\n\u003C\u003Croute-request>>\n\u003C\u003Csend-response>>\n```\n````\n\n- `chunk=\"name\"`: names the block (required for inclusion in the tangled output)\n- `file=\"path\"`: marks it as a root chunk that produces an output file\n- `\u003C\u003Cchunk-name>>`: references another chunk. Expanded recursively during tangling\n\nSame-named chunks are concatenated in document order (additive chunks), enabling progressive elaboration.\n\nFor full syntax details, see `references\u002Fchunk-syntax.md`.\n\n## Workflow\n\nWhen the user asks you to create a literate program from a codebase, follow these steps:\n\n### Step 0: Check for Existing .lit.md\n\nBefore analyzing the codebase, check if a `.lit.md` file already exists in the project. If one exists:\n\n1. Skip creation entirely. Do not recreate from scratch.\n2. Tangle the existing `.lit.md` to regenerate source files:\n   ```bash\n   bun run scripts\u002Ftangle.ts \u003Cfile.lit.md> --output-dir \u003Cdir>\n   ```\n3. Weave the existing `.lit.md` to regenerate the PDF:\n   ```bash\n   pandoc \u003Cfile.lit.md> -o \u003Cfile.pdf> --pdf-engine=xelatex --filter mermaid-filter --toc --number-sections\n   ```\n4. Report what was done and exit.\n\nIf no `.lit.md` exists, proceed with the steps below to create one.\n\n### Step 1: Find Entry Points\n\nLocate where execution begins. Check `package.json`, `main()` functions, `__main__.py`, or the public API surface for libraries. This is where the narrative starts.\n\n### Step 2: Trace Data Flow\n\nFollow data from input to output through the codebase:\n- What does the program consume? (CLI args, files, network, env vars)\n- What transformations does it apply?\n- What does it produce?\n\nEach stage of this pipeline becomes a candidate section.\n\n### Step 3: Identify Background Processes\n\nLook for event loops, worker threads, scheduled tasks, signal handlers, and message queues. These are parallel flows that interact with the main pipeline and deserve their own sections.\n\n### Step 4: Plan Diagrams\n\nChoose diagrams to illustrate the architecture before showing code:\n- Module dependencies → `graph TD`\n- Request lifecycle → `sequenceDiagram`\n- Data pipeline → `graph LR`\n- State machines → `stateDiagram-v2`\n\nCheck `which mermaid-filter` first. If available, write these as ` ```mermaid ` blocks. If not, write them as TikZ `{=latex}` raw blocks (see TikZ section in Writing the .lit.md).\n\nPlace each diagram *before* the code it describes.\n\n### Step 5: Determine Psychological Order\n\nPresent code in the order easiest to understand, not the order files appear on disk. Common strategies:\n- **Top-down**: Architecture first, then drill into components\n- **Data-centric**: Core types first, then operations\n- **Narrative**: Follow a request\u002Fevent from start to finish\n\nEach section should build on the previous one. Defer edge cases and error handling until after the happy path is clear.\n\n### Step 6: Plan the Outline\n\nWrite a section outline before writing any prose or code. Each section should:\n1. Motivate the problem it solves\n2. Show a diagram (if helpful)\n3. Present the code in named chunks\n4. Explain non-obvious decisions\n\nFor detailed guidance, see `references\u002Fanalysis-workflow.md`.\n\n### Step 7: Verify Before Overwriting\n\nBefore tangling for the first time (which overwrites source files), run the tangler in verify mode to confirm the `.lit.md` captures every file completely:\n\n```bash\nbun run scripts\u002Ftangle.ts project.lit.md --output-dir .\u002Fsrc\u002F --verify\n```\n\nThis compares tangled output against existing files without writing anything. If any file differs, it reports the first mismatched line and exits with code 1. Fix all mismatches in the `.lit.md`, then tangle for real.\n\n## Writing the .lit.md\n\n### Document Structure\n\n```markdown\n---\ntitle: \"Project Name — A Literate Program\"\nauthor: \"Author\"\ntoc: true\n# (see assets\u002Fpandoc-header.yaml for full template)\n---\n\n# Introduction\nMotivate the project. What problem does it solve? What is the key insight?\n\n# Section Title\nProse explaining this part of the system...\n\n\\```lang {chunk=\"chunk-name\" file=\"path\u002Fto\u002Ffile.ext\"}\ncode here\n\u003C\u003Creference-to-other-chunk>>\n\\```\n\nMore prose connecting ideas...\n```\n\n### Writing Principles\n\n1. **Byte-for-byte completeness**: Every file with a root chunk (`file=\"path\"`) must have 100% of its content captured in chunks. Tangle will overwrite that file, so any missing content will be deleted. If you don't want to manage a file, don't give it a root chunk.\n\n2. **Prose first**: Every code block should be preceded by prose that explains *why* this code exists and what it accomplishes.\n\n3. **Meaningful chunk names**: Names like `parse-config` or `validate-input` tell the reader what the chunk does. Avoid generic names like `code-1` or `part-a`.\n\n4. **Progressive disclosure**: Introduce concepts gradually. Use additive chunks to build up a definition across multiple sections when that aids understanding.\n\n5. **Cross-references via chunks**: When one section's code references another's via `\u003C\u003Cchunk-name>>`, the reader can follow the logical thread by chunk name rather than hunting through files.\n\n6. **Diagrams before code**: A Mermaid diagram gives the reader a mental model. The code that follows is easier to understand when the reader already sees the big picture.\n\n7. **Math where it helps**: Use LaTeX math (`$...$` inline, `$$...$$` display) for algorithms, protocols, or any logic with a mathematical foundation.\n\n### Mermaid Diagrams\n\nEmbed diagrams directly in the markdown (not inside named chunks):\n\n````markdown\n```mermaid\ngraph LR\n  A[Input] --> B[Parse]\n  B --> C[Transform]\n  C --> D[Output]\n```\n````\n\n### TikZ (when mermaid-filter is unavailable)\n\nIf `which mermaid-filter` returns nothing, use TikZ instead. TikZ diagrams are raw LaTeX embedded via pandoc raw blocks:\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}[...]\n  ...\n\\end{tikzpicture}\n```\n````\n\nThese are invisible in Markdown preview but render correctly in the PDF.\n\n**Translation patterns:**\n\n`graph LR` \u002F `graph TD` → `tikzpicture` with `shapes,arrows` library:\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}[node distance=2cm, auto,\n  block\u002F.style={rectangle, draw, text width=4em, text centered, minimum height=2em},\n  line\u002F.style={draw, -latex}]\n  \\node [block] (A) {Input};\n  \\node [block, right of=A] (B) {Parse};\n  \\node [block, right of=B] (C) {Transform};\n  \\node [block, right of=C] (D) {Output};\n  \\path [line] (A) -- (B);\n  \\path [line] (B) -- (C);\n  \\path [line] (C) -- (D);\n\\end{tikzpicture}\n```\n````\n\n`sequenceDiagram` → manual x\u002Fy placement (or use `pgf-umlsd` if available):\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}\n  \\node at (0,0) {Client};\n  \\node at (4,0) {Server};\n  \\draw[->] (0.3,-0.5) -- node[above]{\\small Request} (3.7,-0.5);\n  \\draw[->] (3.7,-1.2) -- node[above]{\\small Response} (0.3,-1.2);\n\\end{tikzpicture}\n```\n````\n\n`stateDiagram-v2` → `automata` library:\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}[shorten >=1pt, node distance=3cm, on grid, auto,\n  state\u002F.style={circle, draw, minimum size=1.5cm}]\n  \\node [state, initial] (idle) {Idle};\n  \\node [state, right of=idle] (running) {Running};\n  \\node [state, accepting, right of=running] (done) {Done};\n  \\path[->] (idle) edge node {start} (running)\n            (running) edge node {finish} (done);\n\\end{tikzpicture}\n```\n````\n\n### LaTeX Math\n\nFor algorithms or formal descriptions:\n\n```markdown\nThe time complexity is $O(n \\log n)$ due to the sorting step.\n\n$$\nf(x) = \\sum_{i=0}^{n} a_i x^i\n$$\n```\n\n## Producing Output\n\n### TANGLE (extract source code)\n\n```bash\nbun run scripts\u002Ftangle.ts project.lit.md --output-dir .\u002Fsrc\u002F\n```\n\nThis expands all root chunks and writes the source files. Verify by diffing against the original source.\n\n### WEAVE (generate PDF)\n\nBefore weaving, check whether `mermaid-filter` is available:\n\n```bash\nwhich mermaid-filter\n```\n\n**If present**, use the full command:\n\n```bash\npandoc project.lit.md \\\n  -o project.pdf \\\n  --pdf-engine=xelatex \\\n  --filter mermaid-filter \\\n  --toc \\\n  --number-sections \\\n  -V geometry:margin=1.5cm\n```\n\n**If absent**, omit `--filter mermaid-filter` and convert any ` ```mermaid ` blocks to ` ```{=latex} ` TikZ blocks first (see TikZ section above):\n\n```bash\npandoc project.lit.md \\\n  -o project.pdf \\\n  --pdf-engine=xelatex \\\n  --toc \\\n  --number-sections \\\n  -V geometry:margin=1.5cm\n```\n\nFor setup instructions, see `references\u002Fpandoc-setup.md`.\n\n## Quality Checklist\n\nAfter writing the `.lit.md`, verify:\n\n- [ ] **Tangle roundtrip**: `bun run scripts\u002Ftangle.ts --verify` reports all files as byte-for-byte matches\n- [ ] **No dangling references**: Every `\u003C\u003Cchunk-name>>` resolves to a defined chunk\n- [ ] **No unused chunks**: Every defined chunk is referenced by a root chunk (directly or transitively)\n- [ ] **Every source file covered**: Each important source file has a corresponding root chunk with `file=`\n- [ ] **Prose precedes code**: No code block appears without motivating prose\n- [ ] **Diagrams render**: Mermaid diagrams produce correct output in the PDF\n- [ ] **Math renders**: LaTeX expressions compile without errors\n- [ ] **Narrative flows**: A reader unfamiliar with the codebase can follow the document start to finish\n\n## Post-Creation Setup\n\nAfter creating the `.lit.md` and verifying the quality checklist, set up the reverse-sync hook so that edits to source files are automatically synced back into the `.lit.md`.\n\n### 1. Configure the PostToolUse hook\n\nCreate or update the target project's `.claude\u002Fsettings.local.json` to include:\n\n```json\n{\n  \"hooks\": {\n    \"PostToolUse\": [\n      {\n        \"matcher\": \"Edit|Write\",\n        \"command\": \"bun run \u003Cliterate-programming-skill-path>\u002Fscripts\u002Fhook-reverse-sync.ts\"\n      }\n    ]\n  }\n}\n```\n\nReplace `\u003Cliterate-programming-skill-path>` with the absolute path to this skill's installation directory.\n\n### 2. Inform the user\n\nAfter setup, tell the user:\n\n> The `.lit.md` is now the **single source of truth** for your codebase.\n>\n> - **Preferred workflow**: Make all changes in the `.lit.md` file, then tangle to regenerate source files.\n> - **If you edit a source file directly**: The reverse-sync hook will automatically update the `.lit.md` and re-tangle. This keeps everything consistent.\n> - **To regenerate the PDF**: Run `\u002Fliterate-programming` again. Since the `.lit.md` already exists, it will just weave and tangle without recreating the document.\n>\n> The hook does NOT regenerate the PDF on every edit (too slow). PDF generation only happens when you explicitly run `\u002Fliterate-programming`.\n","# Literate Programming\n\nTransform a codebase into a literate program: a document written for human comprehension that also generates the original source code.\n\n## Overview\n\nA literate program is a single `.lit.md` markdown file that serves as both documentation and source code. It produces two outputs:\n\n- **WEAVE** → A PDF (via Pandoc) with prose, diagrams, math, and syntax-highlighted code.\n- **TANGLE** → The original source files, extracted from named code chunks.\n\nThe prose explains *why* the code exists and how it works. The code is embedded in named chunks that can reference each other. The reader follows a narrative, not a file listing.\n\n## Chunk Syntax\n\nCode blocks become named chunks by adding attributes:\n\n````\n```ts {chunk=\"handle-request\" file=\"src\u002Fserver.ts\"}\n\u003C\u003Cparse-headers>>\n\u003C\u003Croute-request>>\n\u003C\u003Csend-response>>\n```\n````\n\n- `chunk=\"name\"`: names the block (required for inclusion in the tangled output)\n- `file=\"path\"`: marks it as a root chunk that produces an output file\n- `\u003C\u003Cchunk-name>>`: references another chunk. Expanded recursively during tangling\n\nSame-named chunks are concatenated in document order (additive chunks), enabling progressive elaboration.\n\nFor full syntax details, see `references\u002Fchunk-syntax.md`.\n\n## Workflow\n\nWhen the user asks you to create a literate program from a codebase, follow these steps:\n\n### Step 0: Check for Existing .lit.md\n\nBefore analyzing the codebase, check if a `.lit.md` file already exists in the project. If one exists:\n\n1. Skip creation entirely. Do not recreate from scratch.\n2. Tangle the existing `.lit.md` to regenerate source files:\n   ```bash\n   bun run scripts\u002Ftangle.ts \u003Cfile.lit.md> --output-dir \u003Cdir>\n   ```\n3. Weave the existing `.lit.md` to regenerate the PDF:\n   ```bash\n   pandoc \u003Cfile.lit.md> -o \u003Cfile.pdf> --pdf-engine=xelatex --filter mermaid-filter --toc --number-sections\n   ```\n4. Report what was done and exit.\n\nIf no `.lit.md` exists, proceed with the steps below to create one.\n\n### Step 1: Find Entry Points\n\nLocate where execution begins. Check `package.json`, `main()` functions, `__main__.py`, or the public API surface for libraries. This is where the narrative starts.\n\n### Step 2: Trace Data Flow\n\nFollow data from input to output through the codebase:\n- What does the program consume? (CLI args, files, network, env vars)\n- What transformations does it apply?\n- What does it produce?\n\nEach stage of this pipeline becomes a candidate section.\n\n### Step 3: Identify Background Processes\n\nLook for event loops, worker threads, scheduled tasks, signal handlers, and message queues. These are parallel flows that interact with the main pipeline and deserve their own sections.\n\n### Step 4: Plan Diagrams\n\nChoose diagrams to illustrate the architecture before showing code:\n- Module dependencies → `graph TD`\n- Request lifecycle → `sequenceDiagram`\n- Data pipeline → `graph LR`\n- State machines → `stateDiagram-v2`\n\nCheck `which mermaid-filter` first. If available, write these as ` ```mermaid ` blocks. If not, write them as TikZ `{=latex}` raw blocks (see TikZ section in Writing the .lit.md).\n\nPlace each diagram *before* the code it describes.\n\n### Step 5: Determine Psychological Order\n\nPresent code in the order easiest to understand, not the order files appear on disk. Common strategies:\n- **Top-down**: Architecture first, then drill into components\n- **Data-centric**: Core types first, then operations\n- **Narrative**: Follow a request\u002Fevent from start to finish\n\nEach section should build on the previous one. Defer edge cases and error handling until after the happy path is clear.\n\n### Step 6: Plan the Outline\n\nWrite a section outline before writing any prose or code. Each section should:\n1. Motivate the problem it solves\n2. Show a diagram (if helpful)\n3. Present the code in named chunks\n4. Explain non-obvious decisions\n\nFor detailed guidance, see `references\u002Fanalysis-workflow.md`.\n\n### Step 7: Verify Before Overwriting\n\nBefore tangling for the first time (which overwrites source files), run the tangler in verify mode to confirm the `.lit.md` captures every file completely:\n\n```bash\nbun run scripts\u002Ftangle.ts project.lit.md --output-dir .\u002Fsrc\u002F --verify\n```\n\nThis compares tangled output against existing files without writing anything. If any file differs, it reports the first mismatched line and exits with code 1. Fix all mismatches in the `.lit.md`, then tangle for real.\n\n## Writing the .lit.md\n\n### Document Structure\n\n```markdown\n---\ntitle: \"Project Name — A Literate Program\"\nauthor: \"Author\"\ntoc: true\n# (see assets\u002Fpandoc-header.yaml for full template)\n---\n\n# Introduction\nMotivate the project. What problem does it solve? What is the key insight?\n\n# Section Title\nProse explaining this part of the system...\n\n\\```lang {chunk=\"chunk-name\" file=\"path\u002Fto\u002Ffile.ext\"}\ncode here\n\u003C\u003Creference-to-other-chunk>>\n\\```\n\nMore prose connecting ideas...\n```\n\n### Writing Principles\n\n1. **Byte-for-byte completeness**: Every file with a root chunk (`file=\"path\"`) must have 100% of its content captured in chunks. Tangle will overwrite that file, so any missing content will be deleted. If you don't want to manage a file, don't give it a root chunk.\n\n2. **Prose first**: Every code block should be preceded by prose that explains *why* this code exists and what it accomplishes.\n\n3. **Meaningful chunk names**: Names like `parse-config` or `validate-input` tell the reader what the chunk does. Avoid generic names like `code-1` or `part-a`.\n\n4. **Progressive disclosure**: Introduce concepts gradually. Use additive chunks to build up a definition across multiple sections when that aids understanding.\n\n5. **Cross-references via chunks**: When one section's code references another's via `\u003C\u003Cchunk-name>>`, the reader can follow the logical thread by chunk name rather than hunting through files.\n\n6. **Diagrams before code**: A Mermaid diagram gives the reader a mental model. The code that follows is easier to understand when the reader already sees the big picture.\n\n7. **Math where it helps**: Use LaTeX math (`$...$` inline, `$$...$$` display) for algorithms, protocols, or any logic with a mathematical foundation.\n\n### Mermaid Diagrams\n\nEmbed diagrams directly in the markdown (not inside named chunks):\n\n````markdown\n```mermaid\ngraph LR\n  A[Input] --> B[Parse]\n  B --> C[Transform]\n  C --> D[Output]\n```\n````\n\n### TikZ (when mermaid-filter is unavailable)\n\nIf `which mermaid-filter` returns nothing, use TikZ instead. TikZ diagrams are raw LaTeX embedded via pandoc raw blocks:\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}[...]\n  ...\n\\end{tikzpicture}\n```\n````\n\nThese are invisible in Markdown preview but render correctly in the PDF.\n\n**Translation patterns:**\n\n`graph LR` \u002F `graph TD` → `tikzpicture` with `shapes,arrows` library:\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}[node distance=2cm, auto,\n  block\u002F.style={rectangle, draw, text width=4em, text centered, minimum height=2em},\n  line\u002F.style={draw, -latex}]\n  \\node [block] (A) {Input};\n  \\node [block, right of=A] (B) {Parse};\n  \\node [block, right of=B] (C) {Transform};\n  \\node [block, right of=C] (D) {Output};\n  \\path [line] (A) -- (B);\n  \\path [line] (B) -- (C);\n  \\path [line] (C) -- (D);\n\\end{tikzpicture}\n```\n````\n\n`sequenceDiagram` → manual x\u002Fy placement (or use `pgf-umlsd` if available):\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}\n  \\node at (0,0) {Client};\n  \\node at (4,0) {Server};\n  \\draw[->] (0.3,-0.5) -- node[above]{\\small Request} (3.7,-0.5);\n  \\draw[->] (3.7,-1.2) -- node[above]{\\small Response} (0.3,-1.2);\n\\end{tikzpicture}\n```\n````\n\n`stateDiagram-v2` → `automata` library:\n\n````markdown\n```{=latex}\n\\begin{tikzpicture}[shorten >=1pt, node distance=3cm, on grid, auto,\n  state\u002F.style={circle, draw, minimum size=1.5cm}]\n  \\node [state, initial] (idle) {Idle};\n  \\node [state, right of=idle] (running) {Running};\n  \\node [state, accepting, right of=running] (done) {Done};\n  \\path[->] (idle) edge node {start} (running)\n            (running) edge node {finish} (done);\n\\end{tikzpicture}\n```\n````\n\n### LaTeX Math\n\nFor algorithms or formal descriptions:\n\n```markdown\nThe time complexity is $O(n \\log n)$ due to the sorting step.\n\n$$\nf(x) = \\sum_{i=0}^{n} a_i x^i\n$$\n```\n\n## Producing Output\n\n### TANGLE (extract source code)\n\n```bash\nbun run scripts\u002Ftangle.ts project.lit.md --output-dir .\u002Fsrc\u002F\n```\n\nThis expands all root chunks and writes the source files. Verify by diffing against the original source.\n\n### WEAVE (generate PDF)\n\nBefore weaving, check whether `mermaid-filter` is available:\n\n```bash\nwhich mermaid-filter\n```\n\n**If present**, use the full command:\n\n```bash\npandoc project.lit.md \\\n  -o project.pdf \\\n  --pdf-engine=xelatex \\\n  --filter mermaid-filter \\\n  --toc \\\n  --number-sections \\\n  -V geometry:margin=1.5cm\n```\n\n**If absent**, omit `--filter mermaid-filter` and convert any ` ```mermaid ` blocks to ` ```{=latex} ` TikZ blocks first (see TikZ section above):\n\n```bash\npandoc project.lit.md \\\n  -o project.pdf \\\n  --pdf-engine=xelatex \\\n  --toc \\\n  --number-sections \\\n  -V geometry:margin=1.5cm\n```\n\nFor setup instructions, see `references\u002Fpandoc-setup.md`.\n\n## Quality Checklist\n\nAfter writing the `.lit.md`, verify:\n\n- [ ] **Tangle roundtrip**: `bun run scripts\u002Ftangle.ts --verify` reports all files as byte-for-byte matches\n- [ ] **No dangling references**: Every `\u003C\u003Cchunk-name>>` resolves to a defined chunk\n- [ ] **No unused chunks**: Every defined chunk is referenced by a root chunk (directly or transitively)\n- [ ] **Every source file covered**: Each important source file has a corresponding root chunk with `file=`\n- [ ] **Prose precedes code**: No code block appears without motivating prose\n- [ ] **Diagrams render**: Mermaid diagrams produce correct output in the PDF\n- [ ] **Math renders**: LaTeX expressions compile without errors\n- [ ] **Narrative flows**: A reader unfamiliar with the codebase can follow the document start to finish\n\n## Post-Creation Setup\n\nAfter creating the `.lit.md` and verifying the quality checklist, set up the reverse-sync hook so that edits to source files are automatically synced back into the `.lit.md`.\n\n### 1. Configure the PostToolUse hook\n\nCreate or update the target project's `.claude\u002Fsettings.local.json` to include:\n\n```json\n{\n  \"hooks\": {\n    \"PostToolUse\": [\n      {\n        \"matcher\": \"Edit|Write\",\n        \"command\": \"bun run \u003Cliterate-programming-skill-path>\u002Fscripts\u002Fhook-reverse-sync.ts\"\n      }\n    ]\n  }\n}\n```\n\nReplace `\u003Cliterate-programming-skill-path>` with the absolute path to this skill's installation directory.\n\n### 2. Inform the user\n\nAfter setup, tell the user:\n\n> The `.lit.md` is now the **single source of truth** for your codebase.\n>\n> - **Preferred workflow**: Make all changes in the `.lit.md` file, then tangle to regenerate source files.\n> - **If you edit a source file directly**: The reverse-sync hook will automatically update the `.lit.md` and re-tangle. This keeps everything consistent.\n> - **To regenerate the PDF**: Run `\u002Fliterate-programming` again. Since the `.lit.md` already exists, it will just weave and tangle without recreating the document.\n>\n> The hook does NOT regenerate the PDF on every edit (too slow). PDF generation only happens when you explicitly run `\u002Fliterate-programming`.\n",{"name":5,"author":24,"license":15,"version":25,"metadata":26,"platforms":34,"description":7},"Tom Lehman + Hermes Agent","1.0.0",{"hermes":27},{"tags":28,"related_skills":33},[5,29,30,31,32],"documentation","pandoc","code-generation","pdf",[],[35,36,37],"linux","macos","windows","main","1f420fcb3f20524e8a830b9d010e0c0ee312d437","hermes-backup\u002Fskills\u002Fliterate-programming","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel","I am a developer at UMG Africa and i have 2 years of software development also i engage with embedded softwares i am good in rust, cpp, python and kotlin","2026-08-16 18:04:02",{"source":8,"skillName":5,"commands":46,"prompt":56,"zipAvailable":57},[47,50,53],{"tool":48,"command":49},"npx","npx skills add abdullibrahim733-pixel\u002FEagle --skill literate-programming",{"tool":51,"command":52},"bunx","bunx skills add abdullibrahim733-pixel\u002FEagle --skill literate-programming",{"tool":54,"command":55},"pnpm","pnpm dlx skills add abdullibrahim733-pixel\u002FEagle --skill literate-programming","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002FSKILL.md",true,[59,65,71,75,79,85,89],{"path":60,"resourceType":61,"resourceTypeDesc":62,"sizeBytes":63,"sourceHtmlUrl":64},"assets\u002Fpandoc-header.yaml","ASSET","资产文件",656,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Fassets\u002Fpandoc-header.yaml",{"path":66,"resourceType":67,"resourceTypeDesc":68,"sizeBytes":69,"sourceHtmlUrl":70},"references\u002Fanalysis-workflow.md","REFERENCE","参考文档",5434,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Freferences\u002Fanalysis-workflow.md",{"path":72,"resourceType":67,"resourceTypeDesc":68,"sizeBytes":73,"sourceHtmlUrl":74},"references\u002Fchunk-syntax.md",3076,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Freferences\u002Fchunk-syntax.md",{"path":76,"resourceType":67,"resourceTypeDesc":68,"sizeBytes":77,"sourceHtmlUrl":78},"references\u002Fpandoc-setup.md",3173,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Freferences\u002Fpandoc-setup.md",{"path":80,"resourceType":81,"resourceTypeDesc":82,"sizeBytes":83,"sourceHtmlUrl":84},"scripts\u002Fhook-reverse-sync.ts","SCRIPT","脚本",3403,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Fscripts\u002Fhook-reverse-sync.ts",{"path":86,"resourceType":81,"resourceTypeDesc":82,"sizeBytes":87,"sourceHtmlUrl":88},"scripts\u002Ftangle.ts",10010,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Fscripts\u002Ftangle.ts",{"path":90,"resourceType":81,"resourceTypeDesc":82,"sizeBytes":91,"sourceHtmlUrl":92},"scripts\u002Funtangle.ts",6340,"https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fliterate-programming\u002Fscripts\u002Funtangle.ts",[94,101,108,115,122,129],{"skillNo":95,"name":96,"nameZh":6,"description":97,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":98,"categories":99,"keywords":100,"publishedAt":19},"01M78BBHAQCSZNG7HYMB97YG3Y","web-ui-verification","Verify web UIs via headless Chrome CDP, no vision needed.","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fsoftware-development\u002Fweb-ui-verification\u002FSKILL.md",[],[],{"skillNo":102,"name":103,"nameZh":6,"description":104,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":105,"categories":106,"keywords":107,"publishedAt":19},"01M78BB60RHXBY2QV4TA9S917B","test-driven-development","TDD: enforce RED-GREEN-REFACTOR, tests before code.","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fsoftware-development\u002Ftest-driven-development\u002FSKILL.md",[],[],{"skillNo":109,"name":110,"nameZh":6,"description":111,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":112,"categories":113,"keywords":114,"publishedAt":19},"01M78BB16QRJZA9P3TXN5SHCQH","systematic-debugging","4-phase root cause debugging: understand bugs before fixing.","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fsoftware-development\u002Fsystematic-debugging\u002FSKILL.md",[],[],{"skillNo":116,"name":117,"nameZh":6,"description":118,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":119,"categories":120,"keywords":121,"publishedAt":19},"01M78BAY69B9JP3SK2NAF3EH2D","spike","Throwaway experiments to validate an idea before build.","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fsoftware-development\u002Fspike\u002FSKILL.md",[],[],{"skillNo":123,"name":124,"nameZh":6,"description":125,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":126,"categories":127,"keywords":128,"publishedAt":19},"01M78BAVDMEBYN49PRDQ8QXTBJ","simplify-code","Parallel 4-agent cleanup of recent code changes.","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fsoftware-development\u002Fsimplify-code\u002FSKILL.md",[],[],{"skillNo":130,"name":131,"nameZh":6,"description":132,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":133,"categories":134,"keywords":135,"publishedAt":19},"01M78BAE09PQ5RV5MSJN1S788A","scroll-driven-3d-websites","Scroll-scrubbed 3D promo sites (Three.js + GSAP).","https:\u002F\u002Fgithub.com\u002Fabdullibrahim733-pixel\u002FEagle\u002Fblob\u002Fmain\u002Fhermes-backup\u002Fskills\u002Fsoftware-development\u002Fscroll-driven-3d-websites\u002FSKILL.md",[],[]]