activity
20192022
most citedThe Distributed Bloom Filter

5 citations · 9 across the 7 of their papers we have counts for

collaborators

7 papers

cs.CR2022

Hypersyn: A Peer-to-Peer System for Mutual Credit

Lum Ramabaja

The Hypersyn protocol is a new type of permissionless and peer-to-peer payment network that is based on the concept of mutual credit and mutual arbitrage. Unlike blockchain-based s…

q-bio.NC2021

The Koha Code: A Biological Theory of Memory

Lum Ramabaja

This work introduces the Koha model, a new theory that aims to explain two unresolved phenomena within biological neural networks: How information is processed and stored within ne…

cs.DC2020

The Binary Vector Clock

Lum Ramabaja

The Binary Vector Clock is a simple, yet space-efficient algorithm for generating a partial order of transactions in account-based blockchain systems. The Binary Vector Clock solve…

cs.CR2020★ 3 cited

Compact Merkle Multiproofs

Lum Ramabaja, Arber Avdullahu

The compact Merkle multiproof is a new and significantly more memory-efficient way to generate and verify sparse Merkle multiproofs. A standard sparse Merkle multiproof requires to…

cs.DS2020

The Bloom Tree

Lum Ramabaja, Arber Avdullahu

We introduce a data structure that allows for efficient (probabilistic) presence proofs and non-probabilistic absence proofs in a bandwidth efficient and secure way. The Bloom tree…

cs.DS2019★ 5 cited

The Distributed Bloom Filter

Lum Ramabaja, Arber Avdullahu

The Distributed Bloom Filter is a space-efficient, probabilistic data structure designed to perform more efficient set reconciliations in distributed systems. It guarantees eventua…

cs.DC2019★ 1 cited

The Bloom Clock

Lum Ramabaja

The bloom clock is a space-efficient, probabilistic data structure designed to determine the partial order of events in highly distributed systems. The bloom clock, like the vector…