Elod Pal Csirmaz

I work as a lead software architect and have a keen interest in algebra, filesystems and computer science in general, as well as in creative writing, visual arts and literary criticism. I live in the UK with my husband and two children.

Computing

  • A Communication Protocol

    and

    Using a wired connection between two computers of two signal lines in each direction we describe protocols that establish the connection whichever program starts first and whatever the initial state of the lines, followed by four data-transfer protocols, the fastest of which sends 24 bits in 17 changes of the sender’s output, with parity checking and retransmission on error. None of the protocols relies on timing: each party only reacts to changes on the other’s lines, so they work between machines of different speeds and tolerate pauses in program execution. Originally developed for LP ports, this article is adatapted from “Egy kommunikációs protokoll [A Transmission Protocol over the LP port],” in Híradástechnika /03, 42–46.

  • Information Inequalities for Five Random Variables

    By Elod Csirmaz and Laszlo Csirmaz, in Computation 2026, 14(2), 42.

    The entropic region is formed by the collection of the Shannon entropies of all subvectors of finitely many jointly distributed discrete random variables. For four or more variables, the structure of the entropic region is mostly unknown. We utilize a variant of the Maximum Entropy Method to obtain five-variable non-Shannon entropy inequalities, which delimit the five-variable entropy region. A significant reduction in computational complexity, achieved through theoretical considerations and by harnessing the inherent symmetries, allowed us to calculate all five-variable non-Shannon inequalities provided by the first nine generations. We define two infinite collections of such inequalities and prove them to be entropy inequalities. We investigate downward-closed subsets of non-negative lattice points that parameterize these collections, and based on this, we develop an algorithm to enumerate all extremal inequalities.

    Read the paper here or on MDPI »
    Get the related code »
    The preprint is available on arXiv »

  • Computer Science
    Synchronizing Many Filesystems in Near Linear Time

    By Elod Csirmaz and Laszlo Csirmaz, in Future Internet 2023; 15(6):198.

    Finding a provably correct subquadratic synchronization algorithm for many filesystem replicas is one of the main theoretical problems in Operational Transformation (OT) and Conflict-free Replicated Data Types (CRDT) frameworks. Based on the Algebraic Theory of Filesystems, which incorporates non-commutative filesystem commands natively, we developed and built a proof-of-concept implementation of an algorithm which synchronizes an arbitrary number of replicas. It is provably correct, and has linear complexity after an initial sorting phase. It works by identifying conflicting command pairs and requesting one of them to be removed; can be guided to reach any of the theoretically possible synchronized states.

    Read the paper here or on MDPI »
    Also available on arXiv »
    Sample implementation of the filesystem synchronization algorithms »

  • openscad-py
    openscad-py: OpenSCAD preprocessor A Python OOP precompiler for OpenSCAD's language. It also contains convenience functions to define a wider range of primitives, vector operations, and a method to export polyhedra directly to STL. Can create a tube-like or toroid polyhedron object from an arbitrary path, and a polyhedron from a 2D matrix of heights.
    Code » | Code mirror » | Reference »
More software, CompSci & papers

Literature & Art

More writings, lit crit & art