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?

Apple's Always-Listening Tech: A Privacy Nightmare Waiting to Happen

Why big tech will hate the Australian tax office's latest ruling

Michaelsoft Binbows

Closure Compiler: A JavaScript checker and optimizer

Anecdotally, Programmers Dislike "Reduce"

BYD has apparently canceled this year's profit bonus

TimIQ – Smart Tech, AI and Software Insights

PlotLines

Satellite images show extent of damage to major Saudi pipeline

Mr

The Void Spiral: How to Avoid the Void

Show HN: TrackLLM: Are the LLM APIs you rely on stable?

Why Does SpaceX Have 11,000 Starlink Satellites? [video]

Why I Still Read Code

Just stop the Anthropic IPO already

'Tidal wave' of PFAS being launched to satisfy AI industry

The bottleneck in multi-agent coding is the human, not the agents

Of Gods and Languages: On "When God Spoke Greek" (2013)

Eliza: The AI That Fooled the World

What is it like to be a Thermostat?

Anthropic tells investors it will be profitable for second straight quarter

Sunsetting Remove.bg

Tork: A lightweight, distributed workflow engine

One UI 9 Beta 2 update is rolling out to the Galaxy S24

The Matrix as Metaphysics

Build to Delete: When a model release makes your work redundant

Show HN: Meta neural band PoC connected to Mac without needing the glasses

Ambition Is Frozen Desire

Show HN: Chrome Extension to Save, Organize and Switch Bookmarks

Ask HN: Why AI is giving biased Racist/Misandrist answers?