Repository navigation
File Catalogs 33 EN
All 2,400 frozen tasks now have complete pre-fix file catalogs. Do not remove large repositories or truncate files. Separate labels and an evaluator are prepared, but these findings establish candidate acquisition, not retrieval quality or LLM savings.
| Item | Result |
|---|---|
| Selected / available / unavailable snapshots | 2,400 / 2,400 / 0 |
| Regular-file / symlink references | 8,039,516 / 5,300 |
| Submodule references | 743 |
| Maximum file candidates per snapshot | 30,223 |
| Maximum file-path byte total per snapshot | 2,838,643 |
| Snapshots exceeding the old 4,096-document bound | 1,008 |
| Snapshots exceeding the old 2MiB text bound | 5 |
References include files repeated across historical snapshots; these are not eight million distinct files. Symlinks remain paths and submodule target repositories are not traversed. AllSelectedCatalogsAvailable=true covers complete tree metadata within the selected repository. Repository aggregates.
Freeze the initial plan, recompute identical membership, and anchor each catalog to its pre-fix root tree ID. Download no source bodies. Only validated complete identities/types/paths/parents/unique entries enter the atomic compressed cache.
The initial run ended at its 2,000-request budget with1,995 catalogs. A405-request continuation reached2,395. The remaining five Babel snapshots exceeded the local8MiB response bound. Five diagnostic requests confirmed this;763 requests under the precommitted subtree plan completed recovery. Recovery mechanism and limits.
Never mark a partial response complete. Persist assembled roots only after all children validate. Keep8MiB network responses,2MiB non-recursive validation,100,000 total entries and16MiB total path bytes, with a separate32MiB decompressed assembled-cache ceiling. Ordinary failures/corrupt caches do not silently enter recovery.
# Prepare pinned source projections and root caches first.
go run ./cmd/riido-filecatalog --request-budget 2000 --out .cache/catalog-pass-1
# Preserve caches and continue into a new output directory.
go run ./cmd/riido-filecatalog --repair-subtrees --request-budget 1500 --out .cache/catalog-pass-2
# Verify complete caches without network requests.
go run ./cmd/riido-filecatalog --offline --out .cache/catalog-replayUse existing GitHub CLI authentication and adjust the budget to remaining API allowance. Output directories must be new. Follow experiment28 sources and experiment29 selection. Keep failures.json and caches private: they contain source identities/local diagnostics.
- Complete-candidate Go search and profiling: up to100,000 paths, global BM25 and baseline-first merging without losing candidates. Existing small APIs retain their bounds.
- Isolated labels:2,398 tasks have old paths; two add only new files. Labels never enter queries, candidate construction or training.
Publish only original code, plans and aggregates. No training, model release, default activation or final-reserve use occurred. Next compare frozen search policies on actual file catalogs.
Collection, ordinary offline replay and an actual2,400-task race run match both public aggregate and private failure list byte for byte. Verify all-task availability and repository-sum conservation. Merge through full Go race/vet, formatting, redacted checks and Linux/macOS CI.
After concurrent race verification finished, one separately timed M4 Pro CPU cache replay took12.16s wall,12.62s user,0.61s sys and46,333,952 bytes maximum RSS (about44.2MiB). This excludes initial network collection, search indexing, models and GPU execution.
Recursive/assembled caches contain3,143 objects and320,112,467 logical bytes; non-recursive tree caches contain10 objects and223,221 bytes. Their combined320,335,688 bytes (about305.5MiB) cover only those two caches, not root metadata, original Parquet, models or the whole workspace. Shared subtrees make object count different from task count.
Follow-up / 후속: Completed evaluation 34 / 실제 평가 완료.
riidolaya is experimental. No demonstrated Codex cost savings; repository selection is preview-only.
riidolaya는 실험 단계입니다. Codex 절감은 미입증이며 저장소 선택은 preview입니다.
English README · 한국어 README · Versioned Wiki sources / Wiki 원본
이전 연구 안내 펼치기 / Earlier research
- 실제 이어 학습 V3 · 한국어 · Actual V3 training · English
- 진행·완료 보고·질문100건 결과 KO · 100-case results EN
- 라벨·이모지·상태 힌트 KO · Content/state hints EN
- 개발 진행·완료 보고·질문 pilot KO · Development pilot EN
- 작은 검증 기록 KO · Compact evidence EN
- 현재 개발 자료 35개·다음 학습 조건 · 35-row data and next training gates
- 개발용 학습 자료 2개 · Two qualified training requests
- 첫 두 과제 실제 관측 · First two actual observations
- 전체 사용법 KO · Full usage EN
- 작은 동작 힌트 KO · Small hints EN
- 설명 보강 비교76 · Caption diagnostic76
- Go 압축 가중치78 · Packed Go weights78
- 공개 함수 동작 검증 · Public function verification
- 다음 학습 자료 준비 · Training data preparation
- 동작에서 학습 정답·실제 학습79 · Grounded labels and actual fit79
- 소스 동작 관찰 · Source observations
- 저장 크기와 RAM · Storage and RAM
- 라이선스 · Licensing
- 시점별 기록 원문 / Chronological history
- 전체 연구 링크 / Full research index
- 문서 목록 / Documentation