fix: Correct algorithm description and deprecation status Key corrections: - Remove "walker steps on existing black pixel" (impossible - walkers terminate when ADJACENT to black, before they can step onto one) - Fix "10-20 messages" claim → actual is O(N) where N = walkers that create black pixels. Broadcasts are sequential, rarely simultaneous. - Fix pseudocode: current position becomes black, NOT next position - Mark Phase 2/3 as DEPRECATED (nanonext sockets fail in crew subprocesses) - Add sync_mode='chunked' as recommended alternative Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>

JohnGavin committed Feb 17, 2026

DOCS: Add Dynamic Grid Broadcasting Algorithm wiki page Closes #89 - Comprehensive technical documentation of the minimal broadcasting algorithm New page: Dynamic-Grid-Broadcasting-Algorithm.md - Problem statement (static vs dynamic approaches) - Algorithm overview with pseudocode - Key innovation: minimal broadcasting (~10-20 messages vs millions) - Eventual consistency model with timing diagrams - Implementation details (R/broadcasting.R functions) - Performance characteristics (~12% overhead) - Pub/sub architecture diagrams - Use cases and limitations - Future phases (Phase 1 complete, Phases 2-3 planned) Updated Home.md with new page link

JohnGavin committed Jan 16, 2026