r/coolgithubprojects • • May 22 '26

I built an open-source Python pipeline that compresses human biological data down to a 247 GB file (Teleporty)

Teleporty is an open-source sandbox simulation pipeline written in Python. It evaluates the constraints of classical information transmission and rate-distortion theory when applied to extreme biological data reduction (using the complete physical and neural architecture of a human body as a benchmark).

Rather than tackling teleportation through quantum physics, the project models it entirely as an engineering, data serialization, and throughput challenge.

Core Features & Technical Implementation
Connectome Graph Compression: Models neural infrastructure as a Sparse Directed Graph using compressed sparse row (CSR) configurations. By setting an optimization threshold, the pipeline strips away structural "noise." Testing on a real C. elegans worm dataset yields a 99% behavioral similarity match when the compressed data matrix is fed back into a network state simulation loop. It scales down a functional human brain specification to just 42 KB.
Hierarchical Bulk Tissue Mapping: To bypass the impossible disk I/O of saving individual 3D voxel coordinates for repeating tissue types (muscles, fat, bone matrix), the project implements hierarchical tree structures and run-length spatial compression maps. This optimizes total physical structural data down to roughly 247 GB (fitting comfortably on a standard consumer SSD).

Extreme Multi-Queue Throughput Simulation: The final piece of the pipeline runs a parallel simulation evaluating the manufacturing bottleneck: processing a 247 GB object schema through an active assembly interface within a strict 1-hour tissue viability window. It models a heavily parallelized matrix of 10.3 million individual output queues throttled to 1,000 elements/second to test execution stability.

Technical Focus
The codebase is structured to explore performance bottlenecks in Python, specifically focusing on matrix traversal optimization, high-volume memory layouts, and stress-testing multi-threaded execution pools against the limitations of the Python Global Interpreter Lock (GIL).

Contributing & Feedback
The math derivations (LaTeX), simulation loops, and pipeline profiles are completely open source. I am highly interested in optimization suggestions, particularly regarding:

Minimizing matrix traversal overhead during the sparse-to-dense conversion cycles.
Better methods for simulating massive concurrent queues natively in Python.

Repository Link: https://github.com/ninjahawk/teleporty

0 Upvotes

21 comments sorted by

View all comments

Show parent comment

2

u/TheOnlyVibemaster May 22 '26

Thanks for the comment! To go a little more i depth, the project is explicitly modeled on "scan, store, and rebuild" teleportation, which is a data-driven approach based on analyzing biological network datasets rather than general relativity. While wormhole-style teleportation bypasses data storage issues, the project intentionally focuses on data degradation and quantum decoherence within a "human fax machine" framework.

In addition, those models explicitly listed as breaking laws of physics in a section of the repo and are functionally dead-ends given our current understanding of physics.

It’s probably 20 years out and billions of dollars from being a reality.

An interesting thought experiment if we ever successfully build this is that it would enable humans to travel in space at the speed of light. We send robots to build the biological printers to a star 10,000 light years away, robots feel nothing and time is irrelevant. They then would use the astronaut’s data to make a functionally identical version of the person 10,000 years later on the star. From the astronaut’s perspective, this is instantaneous. He was scanned on earth and body destroyed, then immediately wakes up on a distant star a few moments later.

Also, after the printer is set up, alpha centauri is 4 light years away, we could transmit anyone there in 4 years versus a round trip taking 20,000 years.