Software / Hashrope

Hashrope.

Persistent sequences for editing, hashing, exact comparison, and compact repetition. Built around a BB[2/7] balanced tree with shared structure.

Data structure

Persistent sequences, exact comparisons.

Hashrope stores a sequence as a balanced tree. Editing can reuse unchanged subtrees, while each node carries polynomial-hash metadata.

EDIT

Build and branch sequences

Concatenate sequences, split them at byte positions, and retain earlier versions. Shared immutable structure makes it practical to explore different edits or agent-context branches.

COMPARE

Choose the right comparison

Use fingerprints to identify candidate matches. For content equality or the exact longest common prefix, use the byte-verifying comparison APIs. Shared structure and repeated spans can reduce work.

REPRESENT

Keep repeated content compact

Represent repeated subtrees without materializing every copy. Substring hashing and streaming sequence hashes support applications that need to inspect a changing window of data.

Packages / November 13, 2026

Four language implementations.

The core packages are at version 0.3.4. Each package links to its installation instructions and language-specific API.

PYTHON · 0.3.4

hashrope

Install with pip install hashrope. The Python package includes persistent editing, exact comparison, hash profiles, and streaming helpers.

JAVASCRIPT / TYPESCRIPT · 0.3.4

hashrope

Install with npm install hashrope. The package provides Node.js and browser builds, including ESM and CommonJS entry points.

RUST · 0.3.4

hashrope

Install with cargo add hashrope. Version 0.3.4 includes Rust improvements to longest-common-prefix comparison and concatenation.

JAVA · 0.3.4

io.github.jemsbhai:hashrope

Available from Maven Central. Use the Java package documentation for dependency configuration and examples.

Applications

Context, biology, and verification.

Explore the library through research experiments, domain tools, and interactive demonstrations.

LLM CONTEXT

Persistent context management

The research experiments use Hashrope for editing and branching context, identifying prefixes, and encoding repetition. The experiment repository accompanies the IEEE ICTAI 2026 paper.

COMPUTATIONAL BIOLOGY

hashrope-bio

The companion Python and Rust libraries apply hash-augmented ropes to genomic regions, mutation localization, tandem repeats, and drug-resistance screening.

EXPLORE

See the structure in use

Try the interactive Hashrope demo and tree visualizer. The qhashrope project connects Hashrope and MultiSpecQR with quantum fingerprint and record-verification experiments. qfourierrope explores spectral phase fingerprints through Qiskit simulations and record-deduplication studies.

Research and talks

From the paper to the implementation.

Read the research, explore the experiments, or watch the cross-language demonstration.

IEEE ICTAI 2026 · ACCEPTED PAPER

Hashrope: A Persistent Data Structure for Mechanisms of LLM Context Management

Muntaser Syed, Ameerah Alsulami, and Marius Silaghi. Presented November 2, 2026 at IEEE ICTAI in Boca Raton. Preprint: arXiv:2610.16144.

DEVFEST FLORIDA · NOVEMBER 7, 2026

Hashrope: One Data Structure, Four Languages

An 18-minute talk on persistent sequences across Python, Rust, Java, and TypeScript, with live demonstrations and cross-language conformance for data pipelines and AI agent memory.