Data · dataset · 2026
Task-Preserving Operational Processes with Bounded Local Memory
Listed in ZivaHub
<p dir="ltr">Online reconstruction systems must decide which history to retain while their tasks and evidence requirements remain explicit.
Description
Agreement on a current value is generally insufficient for agreement after future operations, and retaining the possible states of each component separately can destroy correlations needed by a joint task. We formulate exact task preservation relative to a continuation and evidence contract.
Trace-compatible event transformations, a future-equivalence quotient, and scoped relational projection provide the established mathematical basis. In a restricted integer interval-liquidity model, we exhibit a sharp hierarchy of snapshot retention costs: a fixed current-state query requires no selection bits, hypothetical crossing queries require one bit per Tick block, and position-specific Burn guards require an additional bit per pairing block.
Read the rest (4 more)
For a separate online contract, the Tick-only inventory and evidence epoch are fixed; only nondecreasing cursor moves are permitted, and each move reports only the new cursor and its active liquidity. With Mint, Burn, historical and inventory queries, and evidence revisions excluded, we prove that the minimum additional fixed-length storage at common cuts immediately following completed blocks is one selection bit per remaining block.
We give an explicit suffix-retirement construction and separate semantic preservation from its representation and resource costs. Bounded resident memory and linear processing are conditional on bounded interfaces, representations, and charged external-storage costs. The results concern a declared classical reconstruction model; they do not establish a minimal representation of a full blockchain execution engine or a thermodynamic efficiency theorem.</p><p><br></p><p dir="ltr">Research preprint v1.
Not peer reviewed. Includes a 15-page manuscript PDF and supporting sources. AI assistance and verification limits are disclosed in the manuscript and supporting README.
No new empirical performance measurements or production-data analysis are reported.</p>
Links
Where it is published
- DOI doi.org/10.6084/m9.figshare.34020717.v1 ↗
DOI / persistent id · from zivahub uct ac za
Catalogue records · 1
- OAI-PMH record api.figshare.com/v2/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Af… ↗
metadata API · from zivahub uct ac za
Topics
Provenance · 1 source records, 9 field assertions
| Source | Key | Last seen | Raw |
|---|---|---|---|
| ZivaHub | oai:figshare.com:article/34020717 | 4 d ago | JSON v1 |
| Field | Assertion | Extractor | Evidence |
|---|---|---|---|
| access_level | source · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | |
| concepts[field].anzsrc:field:461203 | mapping · zivahub uct ac za | vocabulary-mapper@1.0.0 | keywords['Formal methods for software'] |
| concepts[field].anzsrc:field:461304 | mapping · zivahub uct ac za | vocabulary-mapper@1.0.0 | keywords['Concurrency theory'] |
| concepts[field].local:field:computer-science-ai | mapping · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | |
| concepts[field].local:field:earth-environmental | mapping · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | |
| description | source · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | /metadata/dc/description |
| license | source · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | /metadata/dc/rights |
| publication_date | source · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | |
| title | source · zivahub uct ac za | connector:zivahub_uct_ac_za@1.0.0 | /metadata/dc/title |