READ BYTES · FRAME EVENTS · CONSUME
Length-prefixed streaming: reconstruct complete messages
Fragment real encoded bytes, inspect the parser buffer and follow complete events into an ordered text consumer.
Text source and visible output
Appended output
Unparsed buffer: first 32 bytes in hex
Your experiment
Use one-byte reads to split the five-byte message prefix. No JSON event may enter the queue until its declared payload length is available.
The text is split into six-code-point deltas, numbered from 1. A source fault targets event 3, or the last event when fewer than three exist. Output is appended only after a complete frame is parsed and consumer processing finishes.
In streaming mode a full application queue pauses reads; one additional event may be processing. In buffered mode all body bytes arrive before parsing begins. The same 60-second inspection maps proportionally to each scenario’s modeled duration; it is not a network performance measurement.
Recent parser and consumer events
Original event fixtures
Offline byte-framing lesson. SSE parsing supports only the generated LF-delimited id/data subset; this is not a complete EventSource implementation. The alternative uses a zero compression byte plus four-byte big-endian payload length and UTF-8 JSON, not Protobuf. No HTTP/2 frames, headers, trailers, grpc-status, compression, TLS, provider API, A2A envelope, retries or reconnect/resume are implemented. The queue policy is application backpressure, not transport flow control. Duplicate suppression and strict contiguous event IDs are explicit application policies, not guarantees supplied by SSE/gRPC. Missing IDs are rejected without reordering or replay. Empty source is complete with no output; an incomplete frame remains truncated. SSE specification · gRPC message framing.
A message prefix is not a network packet
The alternative framing format begins with a compression flag and a four-byte big-endian length, followed by UTF-8 JSON. The decoder waits for a complete prefix and the declared payload before validating an event. This is an actual byte-array parser, but it is deliberately only gRPC-style framing: no HTTP/2 session, protobuf schema, service stub, trailers or remote server exists. The historical Java URL does not imply the browser is executing a Java client. Compare byte fragmentation and application behavior here, then validate transport interoperability separately.
Control the byte and application boundaries
Local text supplies the payload, with the browser limiting entry to one hundred twenty UTF-16 code units. The model groups Unicode code points into records of up to six, each with a sequence identifier and delta string. Framing format selects the LF-delimited SSE subset or an uncompressed five-byte gRPC-style prefix around JSON. Application consumption either parses complete events incrementally or waits for the full body. Bytes per read changes fragmentation, Read interval changes scheduled arrival spacing, Processing per event changes consumer time, and Queued events bounds waiting records separately from the one active record. Parameter edits rebuild the scenario and start inspection unless reduced motion is requested.
Split every part of a length-prefixed message
Choose the length-prefixed format, keep the emoji in the source, select one byte per read and choose Next event repeatedly. The pending-byte count grows while no complete event has reached the queue. Inspect the original event list to distinguish a six-code-point delta from its larger JSON and UTF-8 wire representation. At the end the visible output must equal the source exactly. Repeat with sixty-four bytes per read: larger reads change scheduler work and buffering, not the intended event sequence. The emoji is not replaced just because its encoded bytes arrive separately.
Inject failures and inspect safely
Source event fault repeats, omits or corrupts the third event, or the last available event for a shorter source; truncation removes the final three wire bytes. Ignore already-applied event IDs affects duplicate records only. Missing or malformed records can leave a sequence gap, and later records are rejected rather than reordered or replayed. Play and Pause inspect sixty seconds of viewing time; Next event advances a recorded scheduler transition; Restart inspection rewinds; Speed adjusts viewing pace; Inspection time scrubs. Visible output, pending-byte hex and recent events reflect the inspected prefix. The complete-run preview and original event list describe the full scenario, not work already consumed.
Separate queue capacity from total retained memory
Set read interval to one hundred milliseconds, processing to one thousand and one waiting event. Incremental consumption can pause the reader while one event is queued and another is active. Pending decoder bytes remain a separate storage category. Increase the queue limit and compare read-paused time, peak queued records and peak buffered bytes in the complete-run preview. These are counters from the local scheduler, not Java heap measurements or HTTP/2 flow-control credits. Each scenario is stretched to one viewing minute, so equal inspection times do not mean equal modeled milliseconds.