Companion to walnut-burgundy/computer-science#64.
A real phone workflow exposed a practical input-transport limit: a detailed Max-job prompt was slightly larger than the usable paste path. The response should not be to shorten semantically useful prompts. Treat this as another bounded-streaming workload for Idriç.
Useful compiler/runtime experiment:
- input is one arbitrary Unicode prompt/document larger than one safe paste chunk;
- split on explicit bounded storage without corrupting UTF-8 or code fences/line structure;
- emit ordered chunks carrying enough sequence/count/identity metadata to detect omission, duplication, reordering, or accidental mixing between prompts;
- reconstruct exactly and verify the whole-document digest before treating the prompt as complete;
- malformed/truncated chunk sets must remain explicit failures rather than yielding partial prompts;
- working memory for splitting/verification should be bounded independently of total prompt size where practical;
- do not assume an exact clipboard ceiling until the real phone path is measured.
This is primarily a useful language/runtime/streaming fixture, not a request to put ChatGPT-specific product logic in the compiler.
The important semantic rule is that a transport ceiling must not silently become a context ceiling for a Max job.
Related tracking
Companion to walnut-burgundy/computer-science#64.
A real phone workflow exposed a practical input-transport limit: a detailed Max-job prompt was slightly larger than the usable paste path. The response should not be to shorten semantically useful prompts. Treat this as another bounded-streaming workload for Idriç.
Useful compiler/runtime experiment:
This is primarily a useful language/runtime/streaming fixture, not a request to put ChatGPT-specific product logic in the compiler.
The important semantic rule is that a transport ceiling must not silently become a context ceiling for a Max job.
Related tracking