2 descendants of ec9a66d34d31ab90
|
2026-10-19
| ||
| 11:00 | Classify a cone with path members over the structural graph: the reach walk reads K's trees for their F cards and keeps only the targets a path member covers; a cone with no horizon still classifies by reading leaf check-in: daf58b82e4 user: dmestas tags: horizon-rfc | |
| 06:22 | Send the sync cursor on every request and honour it in every reply; a pull advances the cursor's local count only past what it received; the graph keeps a slot for a citation it cannot resolve and fills it when the artifact arrives; a cone classified afresh records the position and voids older cursors once; hexLower types its count so a 32-byte digest's name is not empty in release builds check-in: 15e7477510 user: dmestas tags: horizon-rfc | |
| 00:04 | Persist the classification and a horizon-independent structural graph beside the store; sync cursor pragma; adopt the log index when serving; commit decides unchanged by the parent's hash algorithm; repo-cksum setting check-in: ec9a66d34d user: dmestas tags: horizon-rfc | |