Coalgebraic Tools for Randomness-Conserving Protocols

TL;DR

This paper introduces a coalgebraic framework for designing and analyzing state-based protocols that efficiently reduce randomness while conserving entropy, enabling compositional construction and analysis of such protocols.

Contribution

It presents a novel coalgebraic approach for building and reasoning about entropy-preserving randomness reduction protocols.

Findings

Protocols can be constructed compositionally using the proposed tools.

The framework allows analysis of the tradeoff between state complexity and entropy loss.

Various entropy-conserving reductions between processes are demonstrated.

Abstract

We propose a coalgebraic model for constructing and reasoning about state-based protocols that implement efficient reductions among random processes. We provide basic tools that allow efficient protocols to be constructed in a compositional way and analyzed in terms of the tradeoff between state and loss of entropy. We show how to use these tools to construct various entropy-conserving reductions between processes.