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?

Programming Bottom-Up (1993)

Show HN: Loböle, open-source parametric CAD that AI agents can drive

The Great Vowel Shift

Language Workbenches: The Killer-App for Domain Specific Languages? (2005)

Apple's iPhone Duo fails JerryRigEverything's durability test

Myst Walkthrough

Sam Altman: 'I No Longer Think We're Gonna Be Able to Just Patch All the Bugs'

How could the US and China verifiably slow AI?

Calibration, accuracy, and domain variation across million collective forecasts

Aulico: Markets with AI for You, Too

'A Golden Age of Science' Brought to You by the White House

Glasswing isn't built to optimize cyberdefense

Object Du Jour: The Vinaigrette

The Trump administration is weaponizing sanctions to silence its critics

History of the Two‑Day Weekend

If the vulnpocalypse is the apocalypse, where are the agentic attacker hordes?

Jack Dorsey's Bitchat Becomes France's Top Social App Amid Mobile Network Outage

The St. Helena 5 pence coin shows Jonathan, a roughly 190 year old tortoise

My Chemical Romance in legal war w Dallas Cowboys Cheerleaders for concert stunt

ZoneTree Became Faster

Show HN: Orisuji, a maze you solve by folding your phone

I'm Addicted to Coding the N64's GPU [video]

Data centres could use 15-20% of current US demand by 2030

1Password for Agents

Piper TTS: A fast, CPU-only neural TTS engine that runs offline

iPhone Duo Durability: Destroyed [video]

WorkshopDL++ Steam Workshop Downloader

Progressive disclosure in agents to make them 2.3x faster

Is the browser becoming the common gateway for AI agents?

Stop Ontology Time