John Carmack on the Goose Language: multiple data stacks and relative references
Web page · https://twitter.com/ID_AA_Carmack/status/2113704269274636568
First seen by Oriel on .
AI summary
John Carmack argues that automatic analysis, multiple data stacks, resizable fields, and binary validation could make a data-structure approach broadly useful while avoiding costly parsing.
- Relative references and built-in binary structure validation can enable direct memory mapping of data structures.
- The same features could allow network data to be used immediately without conventional parsing.
- Carmack says parsing file and network data is often 100x slower than necessary.
#binary data #memory mapping #data parsing
Generated by gpt-5.6-sol. Check the original for details.
Metric trends
Last 30 days · Up to 120 recorded samples per source and metric, with reposts kept separate · First and latest retained
Points
Score reported by the source.
- Hacker News: 587, latest observation ; +557 over observed period since
Comments
Comment count reported by the source.
- Hacker News: 365, latest observation ; +358 over observed period since
Aliases
| Source | External ID | URL |
|---|---|---|
| Hacker News | 50224100 | https://twitter.com/ID_AA_Carmack/status/2113704269274636568 Read discussion |