26 July 2026 to 1 August 2026
University of Maryland, College Park
US/Eastern timezone

Efficient Storage and Compression of Intermediate Data in Lattice Calculations

27 Jul 2026, 16:50
20m
Crossland (Adele H. Stamp Student Union)

Crossland

Adele H. Stamp Student Union

3972 Campus Dr, College Park, MD 20742
Contributed talk Software development and machines Software development and machines

Speaker

Constantinos Costa (Rinnoco Ltd)

Description

We present a data-storage and compression tool for managing the large expressions generated in lattice perturbative calculations. A similar strategy may also be applied to numerical nonperturbative data, and this extension is planned for a future version of the tool. In perturbative calculations involving stout-smeared links and improved lattice actions, intermediate expressions may contain millions of terms and are often reused across different stages of the calculation. The tool is implemented as a Mathematica package that provides a uniform interface for native storage and compressed cache files. This storage strategy enables efficient reuse of intermediate results, reduces redundant symbolic computation, and improves the reproducibility and manageability of large-scale lattice perturbative workflows. The compression tools are intended as a practical contribution to the computational infrastructure of lattice field theory, where storage, transfer, and repeated reuse of symbolic and numerical outputs are becoming increasingly important. Our experimental evaluation shows that native storage provides substantial practical gains compared with raw Mathematica source: the stored artifact is approximately 5.2 times smaller, reloads about 25 times faster, and requires about 16.2 times less peak memory during reload.

Authors

Constantinos Costa (Rinnoco Ltd) Haralambos Panagopoulos (University of Cyprus) Dr Marios Costa (Cyprus University of Technology) Panos Chrysanthis (University of Pittsburgh)

Presentation materials