Decode Bounded Byte Deltas on Spectrum

A path or table whose values change slowly can be stored as a starting value followed by small signed differences.

Use it in a project

COUNT 0–8 deltas are two’s-complement bytes. Starting at BASE, add each delta modulo 256 and write successive values to R0..R7. Return WRITTEN=COUNT and VALID=1. Invalid count leaves all output bytes unchanged and returns WRITTEN=0, VALID=0. BASE is preserved.

Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: WRITTEN, VALID, COUNT, BASE, Q0, Q1, Q2, Q3, Q4, Q5, Q6, Q7, R0, R1, R2, R3, R4, R5, R6, R7. They occupy 20 contiguous bytes. Also reserve the private workspace: T0, T1, T2, EXPR_SAVE (4 bytes). Array names in the explanation refer to the numbered consecutive bindings, such as C0, C1 and so on.

Call bounded_delta_decoder_init once at the intended reset boundary. It clears inputs as well as outputs and workspace. Set your starting state and configuration afterwards, then call bounded_delta_decoder_step whenever the described event occurs. The helper reads no device, waits for no frame and installs no interrupt handler.

Keep a running byte total. Two’s-complement negative deltas work through modulo addition, so no sign branch is needed.

Reusable initialisation and service

; SPDX-License-Identifier: MIT
; Decode Bounded Byte Deltas. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
bounded_delta_decoder_init:
    ld a,0
    ld (WRITTEN),a
    ld (VALID),a
    ld (COUNT),a
    ld (BASE),a
    ld (Q0),a
    ld (Q1),a
    ld (Q2),a
    ld (Q3),a
    ld (Q4),a
    ld (Q5),a
    ld (Q6),a
    ld (Q7),a
    ld (R0),a
    ld (R1),a
    ld (R2),a
    ld (R3),a
    ld (R4),a
    ld (R5),a
    ld (R6),a
    ld (R7),a
    ld (T0),a
    ld (T1),a
    ld (T2),a
    ld (EXPR_SAVE),a
    ret
bounded_delta_decoder_step:
; WRITTEN = 0
    ld a,0
    ld (WRITTEN),a
; VALID = 0
    ld a,0
    ld (VALID),a
; if COUNT > 8:
    ld a,(COUNT)
    cp 8
    jp z,bounded_delta_decoder_L2
    jp nc,bounded_delta_decoder_L1
    jp bounded_delta_decoder_L2
bounded_delta_decoder_L1:
; return
    ret
    jp bounded_delta_decoder_L3
bounded_delta_decoder_L2:
bounded_delta_decoder_L3:
; VALID = 1
    ld a,1
    ld (VALID),a
; T0 = BASE
    ld a,(BASE)
    ld (T0),a
; T1 = 0
    ld a,0
    ld (T1),a
; while T1 < COUNT:
bounded_delta_decoder_L4:
    ld a,(T1)
    ld b,a
    ld a,(COUNT)
    ld c,a
    ld a,b
    cp c
    jp c,bounded_delta_decoder_L5
    jp bounded_delta_decoder_L6
bounded_delta_decoder_L5:
; T2 = Q[T1]
    ld a,(T1)
    ld e,a
    ld d,0
    ld hl,Q0
    add hl,de
    ld a,(hl)
    ld (T2),a
; T0 = T0 + T2
    ld a,(T0)
    ld b,a
    ld a,(T2)
    ld c,a
    ld a,b
    add a,c
    ld (T0),a
; R[T1] = T0
    ld a,(T0)
    ld c,a
    ld a,(T1)
    ld e,a
    ld d,0
    ld hl,R0
    add hl,de
    ld (hl),c
; T1 = T1 + 1
    ld a,(T1)
    add a,1
    ld (T1),a
    jp bounded_delta_decoder_L4
bounded_delta_decoder_L6:
; WRITTEN = COUNT
    ld a,(COUNT)
    ld (WRITTEN),a
    ret
component_end:

Machine contract

AF/BC/DE/HL may change; IX/IY are preserved. A direct CALL needs two return-address stack bytes. The helper makes no nested calls and adds no other stack use. Its named scratch is private workspace, not a pointer, a ROM variable or shared zero-page space that the game may borrow concurrently. The samples use fixed symbol bindings. Scope or rename every label and binding, including the component_end measurement marker, and allocate a separate block for each independent instance. Different helpers can also use common field names, so combining them needs separate namespaces or explicitly renamed bindings. Give each block one mutation owner.

The 48K diagnostic boots through ROM tape loading and USR, disables interrupts and owns the screen. The helper performs no port or screen writes.

Adapt the caller

demo.asm supplies the bindings and include order. exercise.inc first runs table cases, then a separate client retaining state between calls. A game can call the public step entry directly and remove the diagnostic packet and display. Do not copy the diagnostic’s hardware takeover into an existing game loop.

Build with make ASM198X=/path/to/asm198x. The Makefile produces normal, custom, deliberately wrong and repaired programs. Tools must already be installed; the sample downloads nothing.

Bindings and include order

    org $8000
CUSTOM equ 0
BROKEN equ 0
COYOTE_STEPS equ 4
BUFFER_STEPS equ 4
TEXT_CAP equ 8
PROPERTY_COUNT equ 16
STREAM_BYTES equ 13
CRC_POLY equ 7
    include "caller.inc"
    include "exercise.inc"
component_start:
    include "component.inc"
    include "data.inc"
    include "cases.inc"
    include "../../physics/rectangle-overlap/display.inc"
code_end:
STATE:
WRITTEN: defb 0
VALID: defb 0
COUNT: defb 0
BASE: defb 0
Q0: defb 0
Q1: defb 0
Q2: defb 0
Q3: defb 0
Q4: defb 0
Q5: defb 0
Q6: defb 0
Q7: defb 0
R0: defb 0
R1: defb 0
R2: defb 0
R3: defb 0
R4: defb 0
R5: defb 0
R6: defb 0
R7: defb 0
T0: defb 0
T1: defb 0
T2: defb 0
EXPR_SAVE: defb 0
input_ptr: defw 0
output_ptr: defw 0
cases_left: defb 0
ready: defb 0
preview: defs 8,0
OUTPUT: defs 1300,0
    end start

A client retaining state between calls

preview_rules:
    if CUSTOM
; COUNT = 3
    ld a,3
    ld (COUNT),a
; BASE = 255
    ld a,255
    ld (BASE),a
; Q0 = 1
    ld a,1
    ld (Q0),a
; Q1 = 128
    ld a,128
    ld (Q1),a
; Q2 = 127
    ld a,127
    ld (Q2),a
    if BROKEN
; BASE = 0
    ld a,0
    ld (BASE),a
    endif
    call checked_step
    call emit_state
    ret
    else
; COUNT = 4
    ld a,4
    ld (COUNT),a
; BASE = 10
    ld a,10
    ld (BASE),a
; Q0 = 1
    ld a,1
    ld (Q0),a
; Q1 = 255
    ld a,255
    ld (Q1),a
; Q2 = 2
    ld a,2
    ld (Q2),a
; Q3 = 254
    ld a,254
    ld (Q3),a
    if BROKEN
; BASE = 0
    ld a,0
    ld (BASE),a
    endif
    call checked_step
    call emit_state
    endif
    ret

Customise it

Exercise wrapping and the −128 signed delta. The maintained custom caller changes its inputs or client sequence rather than hiding a different implementation behind the same label. Compare every state of the two clients, not only their final display.

Custom client selection

    org $8000
CUSTOM equ 1
BROKEN equ 0
COYOTE_STEPS equ 2
BUFFER_STEPS equ 2
TEXT_CAP equ 4
PROPERTY_COUNT equ 16
STREAM_BYTES equ 13
CRC_POLY equ 49
    include "caller.inc"
    include "exercise.inc"
component_start:
    include "component.inc"
    include "data.inc"
    include "cases.inc"
    include "../../physics/rectangle-overlap/display.inc"
code_end:
STATE:
WRITTEN: defb 0
VALID: defb 0
COUNT: defb 0
BASE: defb 0
Q0: defb 0
Q1: defb 0
Q2: defb 0
Q3: defb 0
Q4: defb 0
Q5: defb 0
Q6: defb 0
Q7: defb 0
R0: defb 0
R1: defb 0
R2: defb 0
R3: defb 0
R4: defb 0
R5: defb 0
R6: defb 0
R7: defb 0
T0: defb 0
T1: defb 0
T2: defb 0
EXPR_SAVE: defb 0
input_ptr: defw 0
output_ptr: defw 0
cases_left: defb 0
ready: defb 0
preview: defs 8,0
OUTPUT: defs 1300,0
    end start

The custom diagnostic row is 03 01 03 FF 01 80 7F 00. The full client trace in the source explains how it gets there.

Mistake and repair

The wrong caller discards the starting value. Every decoded coordinate is shifted. Preserve BASE alongside the delta stream.

The BROKEN branch lives in the sequential client, not the reusable helper. wrong.asm selects it; repaired.asm restores the normal call sequence. The repaired executable matches the normal program (for Spectrum, compare loaded CODE rather than the tape filename).

Select the deliberately wrong client

    org $8000
CUSTOM equ 0
BROKEN equ 1
COYOTE_STEPS equ 4
BUFFER_STEPS equ 4
TEXT_CAP equ 8
PROPERTY_COUNT equ 16
STREAM_BYTES equ 13
CRC_POLY equ 7
    include "caller.inc"
    include "exercise.inc"
component_start:
    include "component.inc"
    include "data.inc"
    include "cases.inc"
    include "../../physics/rectangle-overlap/display.inc"
code_end:
STATE:
WRITTEN: defb 0
VALID: defb 0
COUNT: defb 0
BASE: defb 0
Q0: defb 0
Q1: defb 0
Q2: defb 0
Q3: defb 0
Q4: defb 0
Q5: defb 0
Q6: defb 0
Q7: defb 0
R0: defb 0
R1: defb 0
R2: defb 0
R3: defb 0
R4: defb 0
R5: defb 0
R6: defb 0
R7: defb 0
T0: defb 0
T1: defb 0
T2: defb 0
EXPR_SAVE: defb 0
input_ptr: defw 0
output_ptr: defw 0
cases_left: defb 0
ready: defb 0
preview: defs 8,0
OUTPUT: defs 1300,0
    end start

Cost and alternatives

The measured helper extent is 195 code bytes; public state is 20 bytes and private scratch is 4 bytes. There are no immutable helper tables. Caller data, the test cases, return-address stack, alignment and display buffers cost additional space. These are assembled sizes, not cycle measurements.

Linear in at most eight deltas. Random access needs a checkpoint or decoding the preceding deltas; absolute values cost the same number of bytes unless deltas are further packed.

This format is lossless modulo 256, with exactly one output per delta. It does not itself compress bytes; a narrower packed-delta format needs escape codes for large changes.

Execution evidence

Four variants run on 48K PAL ROM tape load and USR, using Asm198x 0.0.72, Emu198x 0.44.2. Each executes 50 boundary/varied/error table cases, dirty initialisation and the separate retained-state client. An independent mathematical/container model checks every public byte after every call. This is bounded example coverage, not exhaustive correctness for every possible state.

The records retain loaded immutable code, completion, register sentinels, full packets, source/tool/firmware hashes and captures. The public gate validates these retained observations and rejects altered evidence; it does not run restricted firmware. No firmware is distributed. The eight displayed bytes are the first eight public fields, zero-padded when shorter; the packet includes every field.

Where it fits

Bounded RLE decoding: Choose an encoding that matches repetition or small changes in the actual data.

The Craft · Maths for Games · Source and native evidence.