Framing prediction practice

1. Encode abc and an empty message, then predict outputs for whole, bytewise and irregular chunks. Distinguish parser calls from message boundaries.
2. Split a header at all three internal boundaries and a payload at every byte. Retain partial state correctly.
3. Inject EOF at every offset of a single maximum frame. Explain clean versus truncated completion without running code first.
4. Put a valid message before an oversize header in one chunk. Specify both delivered messages and terminal status; explain why delivery cannot be silently undone.
5. Feed partial bytes at 0 and 9 with deadline 10; compare completion at 9 and at 10. Explain why polling must occur without incoming data.
6. Design an adapter with bounded reads, queue capacity, connection count and idle/request deadlines. Connect shutdown to the prior queue module and retry uncertainty to the recovery module.

Preserve predictions, failures, repairs and assistance records. Repeat a fresh chunk/time case after 48 hours. State explicitly which behavior is a protocol decision rather than a TCP requirement.