finding
active
finding:learned-google-g-circuit-uses-927-active-gates-excluding-pass-through-gates-a-and-bLearned Google G circuit uses 927 active gates (excluding pass-through gates A and B)
Circuit complexity metric for colored pattern experiment, largest of all experiments
Source paper
extracted_fromRelated by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Circuit analysis result for Game of Life experiment
- Circuit size finding for checkerboard experiment before pruning
- Remarkably minimal circuit discovered for checkerboard pattern generation
- Learned lizard pattern circuit uses 577 active gates (excluding pass-through gates A and B)finding0.822Circuit complexity metric for lizard experiment
- Demonstration of multi-channel RGB color pattern generation with binary states
- Checkerboard circuit trained on 16x16 grid successfully generalizes to 64x64 grid with 4x more time stepsfinding0.717Grid scaling generalization result demonstrating boundary-size invariance
- Token usage varies roughly 20× across models, from ~14,800 (G3.1-FL) to ~275,000 (G3-F) per gamefinding0.701Reasoning verbosity does not predict strategic strength: both top and weak models span a wide range of token usage.
- Initial gate distribution biased toward pass-through gates A and B to facilitate training stability