
Socratic Teaching Scaffolds
Turns teaching moments into structured learning progressions using question ladders, misconception detectors, and progressive scaffolding removal. You get diagnostic questions to assess understanding, then build sequences from simple to complex with explicit fading strategies across five support levels. Works well when onboarding teammates, explaining technical concepts, or catching faulty mental models through contradiction. The workflow pushes you to design the question ladder upfront rather than winging it, and the Feynman progression approach (analogy to informal to formal) beats just dumping explanations. Honestly most useful when you catch yourself about to over-explain something instead of letting someone work through it with guided discovery.
- skills.sh installs
- 448
- GitHub stars
- 193
- last updated
- Aug 21, 2026
Install
$ npx -y skills add lyndonkl/claude --skill socratic-teaching-scaffolds --agent claude-codeInstalls into .claude/skills of the current project.
Files
Socratic Teaching Scaffolds
Table of Contents
Core components:
- Question Ladders: Sequences from simple to complex that build understanding incrementally
- Misconception Detectors: Questions that reveal faulty mental models through contradiction
- Feynman Explanations: Build-up from simple analogies to technical precision
- Worked Examples with Fading: Full solutions → partial solutions → independent practice
- Cognitive Apprenticeship: Model thinking process explicitly, then transfer to learner
Quick example (Teaching Recursion):
Question Ladder:
- "Can you break this problem into a smaller version of itself?" (problem decomposition)
- "What would happen if we had only one item?" (base case discovery)
- "If we could solve the small version, how would we use it for the big version?" (recursive case)
- "What prevents this from running forever?" (termination reasoning)
Sponsors
Details
- Repository
- github.com/lyndonkl/claude
- Categories
- DevOps & CI/CD, Documentation, Sales & Marketing
- First seen
- Jun 3, 2026