Examples
These files are pulled from the LSL repository at build time and show the main document shapes the spec allows.
YML
The smallest valid document: one concept claim, no extensions.
# The smallest valid LSL document.
# Core layer only. Empty lists are valid — thin-but-honest beats rich-but-fabricated.
lsl: "1.0"
learner: "lrn-3f9qm"
updated: 2026-07-12
concepts:
- name: "CSS Flexbox"
mastery: 0.55
confidence: low
last_seen: 2026-07-10
can:
- "Centers items in a single-row container"
cannot_yet: []
misconceptions: []YML
Multiple concepts, goals, next steps, and document-level provenance.
# Complete example document (Core + light Provenance).
# This is the document from SPEC.md §7 — the spec's acceptance test:
# handed raw to any competent LLM with the instruction "tutor this person,"
# it should produce a well-targeted first session.
lsl: "1.0"
learner: "lrn-8x2ka"
updated: 2026-07-08
subject: "Data Structures & Algorithms"
compiled_by: { name: "leetcode-lsl-exporter", version: "1.2.0" }
sources: ["https://lrs.leetcode.com/xapi/"]
goals:
- objective: "Interview-ready in DSA"
by: 2026-09-01
concepts:
- name: "Recursion"
id: "https://leetcode.com/concepts/cs/dsa/recursion"
mastery: 0.85
confidence: high
last_seen: 2026-05-30
trend: stable
can:
- "Designs recursive solutions with correct base cases for novel problems"
cannot_yet: []
misconceptions: []
- name: "Linked Lists"
id: "https://leetcode.com/concepts/cs/dsa/linked-lists"
mastery: 0.74
confidence: high
last_seen: 2026-06-28
trend: stable
can:
- "Explains node/pointer structure and traverses correctly"
- "Implements insertion and deletion at any position"
cannot_yet:
- "Handles empty-list and single-node edge cases without prompting"
misconceptions: []
- name: "Memoization"
id: "https://leetcode.com/concepts/cs/dsa/memoization"
mastery: 0.68
confidence: med
last_seen: 2026-07-08
trend: rising
can:
- "Writes a correct top-down memoized solution for standard problems"
- "Converts a memoized solution to bottom-up tabulation with guidance"
cannot_yet:
- "Analyzes space complexity tradeoffs of memoized vs tabulated solutions"
misconceptions:
- "Believes memoization always reduces time complexity to O(n)"
teaches_best:
- "Worked examples before open-ended practice"
- "Sessions under 35 minutes"
next:
learn: ["DP Tabulation"]
review: ["Linked Lists"]
blocked:
"DP on Graphs": "needs DP Tabulation"JSON
The same document as Core + Provenance, rendered as JSON.
{
"lsl": "1.0",
"learner": "lrn-8x2ka",
"updated": "2026-07-08",
"subject": "Data Structures & Algorithms",
"compiled_by": { "name": "leetcode-lsl-exporter", "version": "1.2.0" },
"sources": ["https://lrs.leetcode.com/xapi/"],
"goals": [
{
"objective": "Interview-ready in DSA",
"by": "2026-09-01"
}
],
"concepts": [
{
"name": "Recursion",
"id": "https://leetcode.com/concepts/cs/dsa/recursion",
"mastery": 0.85,
"confidence": "high",
"last_seen": "2026-05-30",
"trend": "stable",
"can": [
"Designs recursive solutions with correct base cases for novel problems"
],
"cannot_yet": [],
"misconceptions": []
},
{
"name": "Linked Lists",
"id": "https://leetcode.com/concepts/cs/dsa/linked-lists",
"mastery": 0.74,
"confidence": "high",
"last_seen": "2026-06-28",
"trend": "stable",
"can": [
"Explains node/pointer structure and traverses correctly",
"Implements insertion and deletion at any position"
],
"cannot_yet": [
"Handles empty-list and single-node edge cases without prompting"
],
"misconceptions": []
},
{
"name": "Memoization",
"id": "https://leetcode.com/concepts/cs/dsa/memoization",
"mastery": 0.68,
"confidence": "med",
"last_seen": "2026-07-08",
"trend": "rising",
"can": [
{
"text": "Writes a correct top-down memoized solution for standard problems",
"evidence": ["urn:uuid:4f2a91d0-6c1e-4b8a-9f3d-2e7c5a1b0a44"]
},
"Converts a memoized solution to bottom-up tabulation with guidance"
],
"cannot_yet": [
"Analyzes space complexity tradeoffs of memoized vs tabulated solutions"
],
"misconceptions": [
"Believes memoization always reduces time complexity to O(n)"
]
}
],
"teaches_best": [
"Worked examples before open-ended practice",
"Sessions under 35 minutes"
],
"next": {
"learn": ["DP Tabulation"],
"review": ["Linked Lists"],
"blocked": {
"DP on Graphs": "needs DP Tabulation"
}
}
}YML
An aggregated document with issuer identity, proof, and per-origin claims.
# Federation-layer example: a canonical (aggregated) document.
# Two platforms independently assessed this learner; an aggregator merged their
# claims. Per SPEC.md §4.3: merges are represented (the `from` blocks), never
# overwritten; origin signatures are verified before citing; and because this
# document carries `cannot_yet`/`misconceptions`, it may only be served at
# `tutor` disclosure scope or above.
#
# NOTE: `proof_value` below is a placeholder, not a real signature. A real
# document signs the canonical form per W3C Data Integrity (eddsa-jcs-2022).
lsl: "1.0"
learner: "lrn-8x2ka"
updated: 2026-07-10
subject: "Data Structures & Algorithms"
document_type: canonical
issuer: "https://aggregator.example"
learner_aliases: ["did:web:sarah.dev"]
disclosure: tutor
compiled_by: { name: "example-aggregator", version: "0.4.0" }
sources:
- "https://leetcode.com"
- "https://coursera.org"
proof:
type: "DataIntegrityProof"
cryptosuite: "eddsa-jcs-2022"
verification_method: "https://aggregator.example/.well-known/lsl-keys#key-2026"
proof_value: "z58DAdFfa9SkqZMVPxAQpic7ndSayn1PzZs6ZjWp1CktyGesjuTSwRdo" # placeholder
goals:
- objective: "Interview-ready in DSA"
by: 2026-09-01
concepts:
- name: "Recursion"
id: "https://leetcode.com/concepts/cs/dsa/recursion"
mastery: 0.82 # pooled estimate across origins
confidence: high
last_seen: 2026-07-01
can:
- "Designs recursive solutions with correct base cases for novel problems"
cannot_yet: []
misconceptions: []
from: # per-origin claims survive the merge
- issuer: "https://leetcode.com"
mastery: 0.85
provenance: { method: "elo", n_observations: 19 }
- issuer: "https://coursera.org"
mastery: 0.78
provenance: { method: "quiz-average", n_observations: 12 }
- name: "Memoization"
id: "https://leetcode.com/concepts/cs/dsa/memoization"
mastery: 0.68
confidence: med
last_seen: 2026-07-08
can:
- "Writes a correct top-down memoized solution for standard problems"
cannot_yet:
- "Analyzes space complexity tradeoffs of memoized vs tabulated solutions"
misconceptions:
- "Believes memoization always reduces time complexity to O(n)"
from:
- issuer: "https://leetcode.com"
mastery: 0.68
provenance: { method: "bkt-v2", n_observations: 14 }
next:
learn: ["DP Tabulation"]
review: []
blocked: {}TXT
The prompt-form rendering used by the reader-facing format.
LEARNER: lrn-8x2ka · DSA · updated 2026-07-08
GOAL: interview-ready by 2026-09-01
MISCONCEPTION: believes memoization always yields O(n) time — probe & correct first
CANNOT YET: space tradeoffs memo vs tabulation · LL empty/single-node edge cases
NEXT: learn DP Tabulation | review Linked Lists | blocked: DP on Graphs (needs Tabulation)
MASTERY: recursion 0.85 high · linked-lists 0.74 high (stale 10d) · memoization 0.68↑med
CAN: novel recursive design w/ base cases · top-down memo solutions · LL insert/delete
TEACHES BEST: worked examples first · <35 min sessions