Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Eli Lilly's New Weight-Loss Treatment Shows Promising Results

Web Serial Support in Firefox

World Genesis: Autonomous Agent Civilization Simulator

Show HN: Synrix: hardware-verified memory routing for edge AI agents

Starbucks scraps AI inventory tool across North America

Discover Meko: The Data Infrastructure for Agents That Work and Learn Together

Could Universal GLP-1 Drugs End the Obesity Epidemic?

SpaceX IPO filing lays bare losses and Musk control as it stakes future on AI

Pope Leo launches an AI commission days before he releases a papal letter

22% Layoff at ClickUp

The International Space Station is leaking again

Blog ran on Ubuntu 16.04 for 10 years. I migrated it to FreeBSD

Movesia – Control the Unity Editor with Plain English Commands

Distribution Fine Tuning: A post-training step to make models write better

Volo: Flight tracker built for group travel, delays, gates, and real connections

Built a subscription tracker that uses email forwarding instead of bank linking

Show HN: AI readiness toolkit: AI two-minute CODE maturity check

Schlitz beer ending production after 177 years

JEP Draft: Enhanced Local Variable Declarations (Preview)

The XGO Programming Language

The Founder Mental Health Survey

Event-Sourced Domain Modeling

Socket raises $60M Series C at $1B valuation

Children in Australia tell UK kids how a social media ban has affected them

AI token streaming isn't about SSE vs. WebSockets

Exploring Ref Qualifiers in C++

Claw Patrol: an open-source security firewall for agents

Apple Music's AI stance: "Technology should amplify artists, not replace them"

Just You Wait

ATmosphere 1.0.0 – Liftoff – ActivityPub for WordPress