read-only demo

Videos 8oyalrfwgjw

RLM: Recursive Language Models for Large Codebases - Shashi, Superagentic AI

index_state ready data_status ok

AI Engineer· published 2026-07-12· 0:17:27· en-US· indexed 2026-08-11 03:17

Open on YouTube

Scene timeline

  1. Shot 0, 0:00 to 0:30, 1 of 1 keyframes kept
  2. Shot 1, 0:30 to 0:33, 1 of 1 keyframes kept
  3. Shot 2, 0:33 to 0:35, 1 of 1 keyframes kept
  4. Shot 3, 0:35 to 0:37, 1 of 1 keyframes kept
  5. Shot 4, 0:37 to 0:43, 0 of 1 keyframes kept
  6. Shot 5, 0:43 to 1:11, 1 of 1 keyframes kept
  7. Shot 6, 1:11 to 1:39, 1 of 1 keyframes kept
  8. Shot 7, 1:39 to 2:07, 0 of 1 keyframes kept
  9. Shot 8, 2:07 to 2:08, 1 of 1 keyframes kept
  10. Shot 9, 2:08 to 2:39, 1 of 1 keyframes kept
  11. Shot 10, 2:39 to 3:09, 0 of 1 keyframes kept
  12. Shot 11, 3:09 to 3:34, 1 of 1 keyframes kept
  13. Shot 12, 3:34 to 4:00, 0 of 1 keyframes kept
  14. Shot 13, 4:00 to 4:25, 0 of 1 keyframes kept
  15. Shot 14, 4:25 to 4:50, 0 of 1 keyframes kept
  16. Shot 15, 4:50 to 5:15, 1 of 1 keyframes kept
  17. Shot 16, 5:15 to 5:41, 1 of 1 keyframes kept
  18. Shot 17, 5:41 to 6:06, 0 of 1 keyframes kept
  19. Shot 18, 6:06 to 6:17, 1 of 1 keyframes kept
  20. Shot 19, 6:17 to 6:20, 1 of 1 keyframes kept
  21. Shot 20, 6:20 to 6:22, 1 of 1 keyframes kept
  22. Shot 21, 6:22 to 6:24, 1 of 1 keyframes kept
  23. Shot 22, 6:24 to 6:28, 1 of 1 keyframes kept
  24. Shot 23, 6:28 to 6:29, 1 of 1 keyframes kept
  25. Shot 24, 6:29 to 6:31, 1 of 1 keyframes kept
  26. Shot 25, 6:31 to 6:35, 1 of 1 keyframes kept
  27. Shot 26, 6:35 to 6:38, 1 of 1 keyframes kept
  28. Shot 27, 6:38 to 6:42, 1 of 1 keyframes kept
  29. Shot 28, 6:42 to 6:45, 1 of 1 keyframes kept
  30. Shot 29, 6:45 to 6:50, 1 of 1 keyframes kept
  31. Shot 30, 6:50 to 6:51, 1 of 1 keyframes kept
  32. Shot 31, 6:51 to 7:17, 0 of 1 keyframes kept
  33. Shot 32, 7:17 to 7:43, 0 of 1 keyframes kept
  34. Shot 33, 7:43 to 8:08, 1 of 1 keyframes kept
  35. Shot 34, 8:08 to 8:34, 0 of 1 keyframes kept
  36. Shot 35, 8:34 to 9:00, 0 of 1 keyframes kept
  37. Shot 36, 9:00 to 9:03, 1 of 1 keyframes kept
  38. Shot 37, 9:03 to 9:17, 1 of 1 keyframes kept
  39. Shot 38, 9:17 to 9:22, 1 of 1 keyframes kept
  40. Shot 39, 9:22 to 9:25, 0 of 1 keyframes kept
  41. Shot 40, 9:25 to 9:29, 1 of 1 keyframes kept
  42. Shot 41, 9:29 to 9:33, 1 of 1 keyframes kept
  43. Shot 42, 9:33 to 9:36, 1 of 1 keyframes kept
  44. Shot 43, 9:36 to 9:46, 0 of 1 keyframes kept
  45. Shot 44, 9:46 to 9:48, 1 of 1 keyframes kept
  46. Shot 45, 9:48 to 9:54, 0 of 1 keyframes kept
  47. Shot 46, 9:54 to 9:57, 1 of 1 keyframes kept
  48. Shot 47, 9:57 to 10:00, 1 of 1 keyframes kept
  49. Shot 48, 10:00 to 10:01, 0 of 1 keyframes kept
  50. Shot 49, 10:01 to 10:03, 1 of 1 keyframes kept
  51. Shot 50, 10:03 to 10:06, 1 of 1 keyframes kept
  52. Shot 51, 10:06 to 10:08, 1 of 1 keyframes kept
  53. Shot 52, 10:08 to 10:15, 1 of 1 keyframes kept
  54. Shot 53, 10:15 to 10:23, 1 of 1 keyframes kept
  55. Shot 54, 10:23 to 10:24, 1 of 1 keyframes kept
  56. Shot 55, 10:24 to 10:26, 1 of 1 keyframes kept
  57. Shot 56, 10:26 to 10:27, 1 of 1 keyframes kept
  58. Shot 57, 10:27 to 10:30, 1 of 1 keyframes kept
  59. Shot 58, 10:30 to 10:33, 1 of 1 keyframes kept
  60. Shot 59, 10:33 to 10:34, 1 of 1 keyframes kept
  61. Shot 60, 10:34 to 10:36, 1 of 1 keyframes kept
  62. Shot 61, 10:36 to 10:42, 1 of 1 keyframes kept
  63. Shot 62, 10:42 to 10:46, 1 of 1 keyframes kept
  64. Shot 63, 10:46 to 10:48, 0 of 1 keyframes kept
  65. Shot 64, 10:48 to 10:49, 0 of 1 keyframes kept
  66. Shot 65, 10:49 to 10:50, 0 of 1 keyframes kept
  67. Shot 66, 10:50 to 10:55, 1 of 1 keyframes kept
  68. Shot 67, 10:55 to 10:57, 1 of 1 keyframes kept
  69. Shot 68, 10:57 to 10:59, 1 of 1 keyframes kept
  70. Shot 69, 10:59 to 11:00, 1 of 1 keyframes kept
  71. Shot 70, 11:00 to 11:02, 1 of 1 keyframes kept
  72. Shot 71, 11:02 to 11:06, 1 of 1 keyframes kept
  73. Shot 72, 11:06 to 11:11, 1 of 1 keyframes kept
  74. Shot 73, 11:11 to 11:18, 1 of 1 keyframes kept
  75. Shot 74, 11:18 to 11:24, 1 of 1 keyframes kept
  76. Shot 75, 11:24 to 11:25, 1 of 1 keyframes kept
  77. Shot 76, 11:25 to 11:30, 1 of 1 keyframes kept
  78. Shot 77, 11:30 to 11:33, 1 of 1 keyframes kept
  79. Shot 78, 11:33 to 11:34, 0 of 1 keyframes kept
  80. Shot 79, 11:34 to 11:36, 1 of 1 keyframes kept
  81. Shot 80, 11:36 to 11:37, 1 of 1 keyframes kept
  82. Shot 81, 11:37 to 11:38, 0 of 1 keyframes kept
  83. Shot 82, 11:38 to 11:44, 1 of 1 keyframes kept
  84. Shot 83, 11:44 to 11:48, 1 of 1 keyframes kept
  85. Shot 84, 11:48 to 11:51, 1 of 1 keyframes kept
  86. Shot 85, 11:51 to 11:56, 1 of 1 keyframes kept
  87. Shot 86, 11:56 to 11:58, 1 of 1 keyframes kept
  88. Shot 87, 11:58 to 12:06, 1 of 1 keyframes kept
  89. Shot 88, 12:06 to 12:12, 1 of 1 keyframes kept
  90. Shot 89, 12:12 to 12:14, 0 of 1 keyframes kept
  91. Shot 90, 12:14 to 12:15, 1 of 1 keyframes kept
  92. Shot 91, 12:15 to 12:28, 1 of 1 keyframes kept
  93. Shot 92, 12:28 to 12:30, 1 of 1 keyframes kept
  94. Shot 93, 12:30 to 12:33, 1 of 1 keyframes kept
  95. Shot 94, 12:33 to 12:37, 0 of 1 keyframes kept
  96. Shot 95, 12:37 to 12:41, 1 of 1 keyframes kept
  97. Shot 96, 12:41 to 12:44, 0 of 1 keyframes kept
  98. Shot 97, 12:44 to 12:53, 0 of 1 keyframes kept
  99. Shot 98, 12:53 to 12:57, 1 of 1 keyframes kept
  100. Shot 99, 12:57 to 13:03, 1 of 1 keyframes kept
  101. Shot 100, 13:03 to 13:07, 1 of 1 keyframes kept
  102. Shot 101, 13:07 to 13:10, 1 of 1 keyframes kept
  103. Shot 102, 13:10 to 13:12, 0 of 1 keyframes kept
  104. Shot 103, 13:12 to 13:17, 0 of 1 keyframes kept
  105. Shot 104, 13:17 to 13:19, 1 of 1 keyframes kept
  106. Shot 105, 13:19 to 13:21, 0 of 1 keyframes kept
  107. Shot 106, 13:21 to 13:23, 0 of 1 keyframes kept
  108. Shot 107, 13:23 to 13:25, 0 of 1 keyframes kept
  109. Shot 108, 13:25 to 13:34, 0 of 1 keyframes kept
  110. Shot 109, 13:34 to 13:40, 1 of 1 keyframes kept
  111. Shot 110, 13:40 to 13:44, 1 of 1 keyframes kept
  112. Shot 111, 13:44 to 13:48, 1 of 1 keyframes kept
  113. Shot 112, 13:48 to 13:58, 1 of 1 keyframes kept
  114. Shot 113, 13:58 to 14:00, 1 of 1 keyframes kept
  115. Shot 114, 14:00 to 14:01, 1 of 1 keyframes kept
  116. Shot 115, 14:01 to 14:04, 1 of 1 keyframes kept
  117. Shot 116, 14:04 to 14:06, 1 of 1 keyframes kept
  118. Shot 117, 14:06 to 14:21, 0 of 1 keyframes kept
  119. Shot 118, 14:21 to 14:23, 1 of 1 keyframes kept
  120. Shot 119, 14:23 to 14:24, 1 of 1 keyframes kept
  121. Shot 120, 14:24 to 14:42, 1 of 1 keyframes kept
  122. Shot 121, 14:42 to 14:45, 1 of 1 keyframes kept
  123. Shot 122, 14:45 to 14:54, 0 of 1 keyframes kept
  124. Shot 123, 14:54 to 14:57, 1 of 1 keyframes kept
  125. Shot 124, 14:57 to 15:24, 1 of 1 keyframes kept
  126. Shot 125, 15:24 to 15:52, 0 of 1 keyframes kept
  127. Shot 126, 15:52 to 16:19, 1 of 1 keyframes kept
  128. Shot 127, 16:19 to 16:47, 0 of 1 keyframes kept
  129. Shot 128, 16:47 to 17:14, 0 of 1 keyframes kept
  130. Shot 129, 17:14 to 17:19, 1 of 1 keyframes kept
  131. Shot 130, 17:19 to 17:26, 1 of 1 keyframes kept

131 shot(s).

keyframes kept every frame deduplicated

What was stored

cues
135
whisperx 135
chunks
32
from 135 cues
keyframes
96
kept of 131 captured
frames with text
94
2,811 lines read
chapters
0
from the source metadata
keyframe bytes
18.0 MB
word timings on 135 cues

Provenance

Each pipeline stage, its state and the model that produced it
stage state model started took
fetch done 2026-08-11 03:11 1m 26s
stt done 2026-08-11 03:13 23s
chunk done 2026-08-11 03:13 0s
text_embed done 2026-08-11 03:13 0s
keyframe done 2026-08-11 03:13 2m 43s
ocr done 2026-08-11 03:16 1m 11s
frame_embed done 2026-08-11 03:17 18s

Frames, and what the machine read

  • 0:23 #0 done24 line(s)

    shot 0·sharpness 1606.4

    1. localhost1.00
    2. +0.90
    3. AI ENGINEER WORLD'S FAIR 20260.99
    4. Online Track1.00
    5. RLM:Recursive1.00
    6. LanguageModels1.00
    7. MIT RLM PAPER1.00
    8. Recursive Language Models1.00
    9. for Large0.95
    10. RLMs use a programmable environment for long-1.00
    11. context inference.1.00
    12. Codebases I0.91
    13. arXiv:2512.246010.99
    14. A coding-agent harness pattern, inspired by the MIT1.00
    15. RLM paper.0.99
    16. MIT RESEARCH1.00
    17. The RLM concept1.00
    18. MIT RLM paper: arXiv:2512.246010.99
    19. Use the RLM control loop as a coding-agent0.98
    20. harness pattern for large repository investigation1.00
    21. Shashi Jagtap1.00
    22. Founder, Superagentic Al1.00
    23. RLM: Coding-Agent Harness Pattern for Large Codebases0.99
    24. next back F fullscreen0.93
  • 0:32 #1 done35 line(s)

    shot 1·sharpness 4950.1

    1. pecoming an independent0.97
    2. We gratefully acknowledge support from the Simons1.00
    3. Donate1.00
    4. onprofit.1.00
    5. Foundation, member institutions, and all contributors.0.99
    6. Search...1.00
    7. All fields1.00
    8. Search1.00
    9. Help | Advanced Search0.98
    10. Access Paper:1.00
    11. View P1.00
    12. HTML (e0.99
    13. nental)0.99
    14. TeX Source0.99
    15. (cc) BY0.93
    16. view license1.00
    17. Current browse context:0.99
    18. ns of inference-time scaling. We propose Recursive Language0.99
    19. cs.Al1.00
    20. nment and allows the LLM to programmatically examine,0.98
    21. < prev0.92
    22. next >0.98
    23. lly process inputs up to two orders of magnitude beyond model1.00
    24. new | recent | 2025-120.94
    25. ier LLMs and common long-context and coding scaffolds (e.g., on1.00
    26. Change to browse by:0.98
    27. deAct with sub-calls, and 13%against Claude Code) across four0.98
    28. CS0.66
    29. odel around the RLM. Our model, RLM-Qwen3-8B, outperforms0.99
    30. cs.CL1.00
    31. PT-5 on three long-context tasks. Code is available at this https0.98
    32. References & Citat0.99
    33. NASA ADS1.00
    34. Google Scholar1.00
    35. Semantic Scholar0.99
  • 0:34 #2 done14 line(s)

    shot 2·sharpness 2010.0

    1. arxiv.org1.00
    2. C0.63
    3. Agent Harness Secret for Massive Codebases1.00
    4. https://arxi1.00
    5. Recursive Language Models1.00
    6. Alex L. Zhang0.99
    7. Tim Kraska1.00
    8. Omar Kh1.00
    9. MIT CSAIL0.95
    10. MIT CSAIL0.96
    11. MIT CSA0.98
    12. [email protected]1.00
    13. [email protected]1.00
    14. [email protected]1.00
  • 0:37 #3 done19 line(s)

    shot 3·sharpness 1818.1

    1. LM:Recursive1.00
    2. MIT RLM PAPER1.00
    3. anguage Models0.97
    4. Recursive L0.99
    5. or Large0.98
    6. RLMs use a progra1.00
    7. context inference.1.00
    8. odebases lı0.89
    9. arXiv:2512.246011.00
    10. oding-agent harness pattern, inspired by the MIT1.00
    11. A paper.0.89
    12. MIT RESEARCH1.00
    13. The RLM co0.95
    14. T RLM paper: arXiv:2512.246010.99
    15. Use the RI M contr0.99
    16. ha1.00
    17. fo1.00
    18. ashi Jagtap1.00
    19. under, Superagentic Al0.98
  • 0:41 #4 skipped

    shot 4·duplicate of #0

  • 0:46 #5 done22 line(s)

    shot 5·sharpness 1231.0

    1. <0.88
    2. localhost1.00
    3. +0.87
    4. The problem1.00
    5. Large repositories require stateful, structured investigation.1.00
    6. SMALL REPO1.00
    7. LARGE REPO0.99
    8. MORE CONTEXT0.99
    9. REAL PROBLEM1.00
    10. One file, one test, one0.99
    11. Lost architecture,1.00
    12. Bigger windows add1.00
    13. A codebase is a1.00
    14. function. Agents handle1.00
    15. ownership, and cross-file0.99
    16. noise. Tool output floods1.00
    17. structured system, not a0.99
    18. this well.1.00
    19. links.1.00
    20. the chat.1.00
    21. long document.0.99
    22. RLM: Coding-Agent Harness Pattern for Large Codebases1.00
  • 1:17 #6 done25 line(s)

    shot 6·sharpness 1311.0

    1. <0.92
    2. localhost1.00
    3. +0.89
    4. How people tackle it today0.98
    5. Search, retrieval, and longer context all help.1.00
    6. FILESYSTEM TOOLS1.00
    7. SEMANTIC RETRIEVAL1.00
    8. LONG CONTEXT1.00
    9. AGENT MEMORY0.97
    10. Search the repo directly0.99
    11. Find likely-relevant0.99
    12. Load or compress0.97
    13. Persist working state0.99
    14. grep, file readers, virtual FS.0.99
    15. code1.00
    16. evidence1.00
    17. Scratchpads and task state1.00
    18. Good when paths are known.1.00
    19. Embeddings narrow the0.98
    20. Bigger windows help, but detail1.00
    21. avoid rereading every token.0.99
    22. haystack, but can miss1.00
    23. competes with noise.1.00
    24. structure.1.00
    25. RLM: Coding-Agent Harness Pattern for Large Codebases0.99
  • 1:58 #7 skipped

    shot 7·duplicate of #6

  • 2:08 #8 done8 line(s)

    shot 8·sharpness 1383.2

    1. ontext management1.00
    2. 1. The repository is treated0.99
    3. to a programmable0.99
    4. 2. The model writes code to1.00
    5. xecution1.00
    6. nvironment.1.00
    7. 3. Focused subquestions re1.00
    8. rness Pattern for Large Codebases1.00
  • 2:35 #9 done12 line(s)

    shot 9·sharpness 1272.6

    1. localhost1.00
    2. THE THESIS0.98
    3. RLMexternalizes1.00
    4. MIT RLM paper: arXiv:2512.246010.97
    5. context management0.98
    6. 1. The repository is treated as data the model can operate on.0.99
    7. into aprogrammable0.97
    8. 2. The model writes code to inspect, slice, and compute.0.99
    9. execution1.00
    10. environment.1.00
    11. 3. Focused subquestions return clean values.1.00
    12. RLM: Coding-Agent Harness Pattern for Large Codebases0.99
  • 3:00 #10 skipped

    shot 10·duplicate of #9

  • 3:31 #11 done35 line(s)

    shot 11·sharpness 1355.5

    1. <0.87
    2. localhost1.00
    3. +0.95
    4. 0.60
    5. The analogy0.98
    6. A senior engineer with a notebook.0.98
    7. Q1.00
    8. Large project1.00
    9. Files, docs, tests, configs0.99
    10. Focused helper1.00
    11. task1.00
    12. inspect this1.00
    13. Notebook1.00
    14. Persistent REPL state1.00
    15. Engineer doing1.00
    16. evidence1.00
    17. the1.00
    18. Investigation scripts1.00
    19. Model-written Python0.99
    20. investigation1.00
    21. evidence, and open1.00
    22. keeps notes,1.00
    23. questions1.00
    24. Clean note1.00
    25. Focused helper1.00
    26. question1.00
    27. Ilm_query(...)0.94
    28. returned1.00
    29. added back to the0.98
    30. Returned note1.00
    31. A clean value for synthesis1.00
    32. notebook1.00
    33. Recursion = the parent REPL calling 11m_query(. .. )0.98
    34. antting a clean value back.0.99
    35. RLM: Coding-Agent Harness Pattern for Large Codebases0.99
  • 3:40 #12 skipped

    shot 12·duplicate of #11

  • 4:05 #13 skipped

    shot 13·duplicate of #11

  • 4:42 #14 skipped

    shot 14·duplicate of #11

  • 5:08 #15 done17 line(s)

    shot 15·sharpness 883.4

    1. localhost1.00
    2. +0.92
    3. The loop0.95
    4. How the harness actuallyruns.1.00
    5. Repo context1.00
    6. Root model1.00
    7. Python REPL1.00
    8. context1.00
    9. writes repl code1.00
    10. bounded observation1.00
    11. Recursive subcall0.99
    12. Clean result1.00
    13. Finish1.00
    14. llm_query(...)0.97
    15. value returns1.00
    16. FINAL / FINAL_VAR0.99
    17. RLM: Coding-Agent Harness Pattern for Large Codebases0.98
  • 5:38 #16 done24 line(s)

    shot 16·sharpness 1199.5

    1. <0.86
    2. localhost1.00
    3. +0.94
    4. 0.57
    5. Why codebases0.98
    6. Repos are structured and executable.0.99
    7. REPOSITORY AS STRUCTURED DATA1.00
    8. runner.py1.00
    9. orchestration1.00
    10. environment.py1.00
    11. REPL state0.97
    12. 1 Files and directories give the model a map.0.98
    13. 2 Imports and symbols reveal execution paths.1.00
    14. termination.py1.00
    15. FINAL /FINAL_VAR0.97
    16. Tests and fixtures expose intended behavior.0.99
    17. tests/1.00
    18. behavior checks1.00
    19. 4 Configs and docs explain runtime assumptions.0.99
    20. README.md1.00
    21. usage contract1.00
    22. MODEL-WRIEN INSPECTION0.99
    23. extract ewnce → llm_query → FINAL0.95
    24. RLM: Coding-Agent Harness Pattern for Large Codebases0.99
  • 5:53 #17 skipped

    shot 17·duplicate of #16

  • 6:15 #18 done10 line(s)

    shot 18·sharpness 818.4

    1. localhost1.00
    2. è0.72
    3. +0.77
    4. 020.93
    5. RLMCode1.00
    6. An independent experimental reference implementation used to demonstrate the pattern.0.99
    7. Landing page1.00
    8. Docs1.00
    9. GitHub1.00
    10. RLM: Coding-Agent Harness Pattern for Large Codebases1.00
  • 6:18 #19 done6 line(s)

    shot 19·sharpness 502.0

    1. 020.98
    2. RLMCode1.00
    3. An independent experimental reference implementation used to der1.00
    4. Landing1.00
    5. Docs1.00
    6. GitHub1.00
  • 6:22 #20 done31 line(s)

    shot 20·sharpness 1892.3

    1. super-agentic.ai1.00
    2. X0.67
    3. +0.94
    4. RLM: The Coding Agent Harness Secret for Massive Codebases0.98
    5. RLM Code | Research Playground for Recursive Language Models | Superagentic Al1.00
    6. SuperagenticAI1.00
    7. <> Products0.99
    8. Solutions1.00
    9. OSS0.76
    10. Research1.00
    11. Resources0.95
    12. Company1.00
    13. RESEARCH-FIRST EVALUATION OS1.00
    14. RLMCode1.00
    15. Research Playground for Recursive0.99
    16. Language Models1.00
    17. Run real RLM workflows, benchmark them, replay every step, and1.00
    18. compare results under controlled budgets and secure sandboxes.1.00
    19. Open source under Apache-2.0. Explore the project on GitHub.0.98
    20. Start with Docs0.99
    21. View GitHub1.00
    22. Apache-2.01.00
    23. PyPI Package1.00
    24. Research-first1.00
    25. What is included1.00
    26. Preferred stack1.00
    27. Code Mode support1.00
    28. Watch demo1.00
    29. Quick workflow1.00
    30. Security1.00
    31. FAQ1.00
  • 6:23 #21 done32 line(s)

    shot 21·sharpness 1924.5

    1. super-agentic.ai1.00
    2. X0.60
    3. +0.95
    4. RLM: The Coding Agent Harness Secret for Massive Codebases1.00
    5. RLM Code | Research Playground for Recursive Language Models | Superagentic Al0.99
    6. SuperagenticAI1.00
    7. <> Products0.99
    8. Solutions1.00
    9. OSS0.72
    10. Research1.00
    11. Resources0.95
    12. V0.82
    13. Company0.91
    14. RESEARCH-FIRST EVALUATION OS0.99
    15. RLMCode1.00
    16. Research Playground for Recursive1.00
    17. Language Models1.00
    18. Run real RLM workflows, benchmark them, replay every step, and1.00
    19. compare results under controlled budgets and secure sandboxes.1.00
    20. Open source under Apache-2.0. Explore the project on GitHub.0.98
    21. Start with Docs0.99
    22. View GitHub1.00
    23. Apache-2.01.00
    24. PyPI Package1.00
    25. Research-first1.00
    26. What is included0.99
    27. Preferred stack1.00
    28. Code Mode support1.00
    29. Watch demo1.00
    30. Quick workflow1.00
    31. Security1.00
    32. FAQ1.00
  • 6:27 #22 done51 line(s)

    shot 22·sharpness 2263.7

    1. super-agentic.ai1.00
    2. ×0.79
    3. +0.97
    4. RLM: The Coding Agent Harness Secret for Massive Codebases1.00
    5. RLM Code | Research Playground for Recursive Language Models | Superagentic Al0.99
    6. SuperagenticAI1.00
    7. <> Products0.95
    8. Solutions1.00
    9. Oss0.54
    10. Research0.95
    11. Resources0.97
    12. Company0.97
    13. V0.90
    14. RESEARCH-FIRST EVALUATION OS1.00
    15. RLM Code0.97
    16. RLM1.00
    17. RLM Code1.00
    18. Research Playground for Recursive1.00
    19. CODE-0.98
    20. Research Playground & Evaluation OS for RLM Agentic Systems1.00
    21. Language Models1.00
    22. RLM0.86
    23. Files0.95
    24. Details0.97
    25. Shell1.00
    26. Research Lab0.97
    27. One Screen:0.97
    28. Quit0.80
    29. Run real RLM workflows, benchmark them, replay every step, and1.00
    30. RLM Restarch Lib0.83
    31. compare results under controlled budgets and secure sandboxes.0.99
    32. Dashboard1.00
    33. Trajectory1.00
    34. Benchnarks0.99
    35. Replay0.99
    36. Events0.99
    37. Open source under Apache-2.0. Explore the project on GitHub.0.99
    38. Rum Dashboard0.98
    39. Start with Docs1.00
    40. View GitHub1.00
    41. aolong_style0.94
    42. Apache-2.01.00
    43. PyPI Package1.00
    44. Research-first1.00
    45. What is included0.99
    46. Preferred stack1.00
    47. Code Mode support1.00
    48. Watch demo1.00
    49. Quick workflow1.00
    50. Security1.00
    51. FAQ1.00
  • 6:28 #23 done11 line(s)

    shot 23·sharpness 694.4

    1. RLM: The Coding Agent Harness Secret fic0.97
    2. SuperagenticAI1.00
    3. <> Products0.97
    4. 0.67
    5. Solutions0.94
    6. 0SS0.60
    7. RESEARCH-FIRST EVALUATION OS0.99
    8. RLMCode1.00
    9. Research Playground for Recursive1.00
    10. Language Models0.97
    11. Pun real Rl M workflowe. henehmark them mwvay every st ay0.83

Transcript

135 cues· 2,394 words· 12,806 chars

  1. 0:00 Hello, and welcome to this online track talk for the AI Engineer World's Fair 2026.
  2. 0:08 Today, we're going to explore the concept of RLM, also known as recursive language models, and how we can use those concepts for larger code bases.
  3. 0:20 My name is Shashi.
  4. 0:21 I'm a founder of SuperAgenti.KI.
  5. 0:23 First of all, let's be clear that RLM paper has been published by MIT and Friends.
  6. 0:30 As you can see, there's a full paper.
  7. 0:32 You can read about it.
  8. 0:34 But the purpose of this talk is how you can use the concepts of RLM.
  9. 0:39 and you can use into your own workflow to implement your own harnesses so first of all what's the problem if you're using the coding agents for smaller repos or monorepos they work exceptionally well but if you have ever tried it with the monorepos with the large context you know there is a context problem as the context grows the performance degrade and if you're working with the monorepos this problem get worst
  10. 1:05 In this talk, we will see we selected the code base and the concept of RLMs are relevant for the larger code bases.
  11. 1:15 If you use the coding agents, then you probably saw that there are different approaches that other coding agent harnesses have been taken to solve this problem.
  12. 1:23 Most common approach is searching using the tools like grep.
  13. 1:28 So basically there's a file system and the coding agent harnesses search using these tools.
  14. 1:34 The second approach you probably seen that the semantic search or the local search.
  15. 1:40 So idea here is basically you can search through the code and curate the context.
  16. 1:46 Another approach is the long context get compressed, and you can use the summarized version of the context.
  17. 1:54 And there are some memory solutions available in the market as well that you can use to persist the memory for the coding agent.
  18. 2:05 First of all, let's explore the RLM idea.
  19. 2:08 The core thesis of the RLM is you need to externalize the context management into programmable execution environment, meaning you should have a separate dedicated environment so that model can operate on that.
  20. 2:23 In this case, for example, your whole repository is treated as a data that model can operate on.
  21. 2:30 Then model can write the code to inspect, slice, and compute the relevant chunks of value you can then feed into the main context window.
  22. 2:42 So basically rather than putting everything into the models context, create a separate dedicated environment, give them a coding agent or REPL, and then model write the code to curate the context that can be used into the main.
  23. 2:59 So it's another context management technique proved to be very effective.
  24. 3:04 Could be also be used as a memory layer for your coding agents.
  25. 3:10 Let me summarize this, giving you a simple analogy.
  26. 3:14 Imagine you are a lead software engineer and assigned to the new project with a huge code base.
  27. 3:22 Imagine that's Mono repo.
  28. 3:24 How does that lead engineer deal with the code?
  29. 3:28 So rather than reading
  30. 3:31 line of code line by line engineer probably inspect the code base make some notes see what are the project's dependencies how it is structured if it's something else is not understood by the repository engineer probably asked to another engineer or expert to get some ideas and the same concepts applied in rlm so large project like the files and docs and texts and configs because repository has a lot of things
  31. 4:02 And the programmable REPL, it's kind of a notebook that engineer makes a note about the code base that can be used.
  32. 4:08 He's searching, he may be using other techniques or maybe he's writing some script to search something from the repo.
  33. 4:16 And then if he stacks, then he asks another engineer or specialist where it comes to the LLM query.
  34. 4:25 and LLM query is basically asking another model environment to get answer from and once they get answer then the loop continues and at the end it returns the clean node synthesis so the recursion part here is engineer ask another specialist using LLM query that can be one question or that can be number of questions so this is where the recursion comes in picture
  35. 4:54 loop is basically your repo as your context and then the model writes the repl code to get some relevant context that returns the bounded observation and if we if loop needs more information it passes through the llm query where it asks another language model or another system to get the response return the value and continue the loop
  36. 5:25 and the loop get terminated until we get to final results.
  37. 5:31 Why are we talking about the code base?
  38. 5:33 and not the big context in terms of like other things, for example, books or dictionaries.
  39. 5:38 Codebase is different.
  40. 5:40 It has directories, it has tests, it has some imports, it has dependencies, it has tests, it has pictures, it has configuration files.
  41. 5:50 So the codebase is not only just the text, it is structured data.
  42. 5:56 And the model need to understand and reason over the text.
  43. 6:01 That's why I chose this scenario to use a code basis to prove these concepts of RLM.
  44. 6:09 Now let's switch the gear and talk about our own library that we created at SuperAgent TKI called RLM Code.
  45. 6:18 You can see RLM Code's landing page here, where this is just a research playground where you can invent the concepts of RLM.
  46. 6:29 We have documentation that you can take a look and there's the GitHub repository.
  47. 6:37 It is completely open source project that you can use it and play with it.
  48. 6:46 RLM itself is a concept and a pattern.
  49. 6:51 and you can implement that concept and pattern in your own way there are official authors also wrote some implementation in their github repos it's called rlm and rlm minimal you can refer that implementation of rlm in dspy.rlm so omar
  50. 7:15 is author of RLM and he's also author of another popular framework called DSPy.

Open at this second