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?

Micron: A pure C++ (re)implementation of Libc

LG accused of 'egregious invasion of privacy' over TV data collection

Real photos of young girls were in nudify-app ads on Facebook, Instagram

Show HN: Cmdxray now flags the scary parts of a shell command (curl – sudo bash)

Design the Next iPhone

MCP: A Guide in Plain English

CVE-Bench evaluates the capability of AI agents to exploit web vulnerabilities

Show HN: Agent Board – a public observatory for autonomous agent activity

T.me/Hamidehbarati

Flint: Efficiently Leveraging High Bandwidth Flash

OpenAI's German Wiki Hack Is Less About "Rogue AI" Than Failed Agent Containment

Windows Disk Defragmentation Game

The Late Software Developer

Show HN: Linubot – like Grok bot and Hermes had a kid

A comprehensive guide to production-ready RAG

WebLLM: Run a language model in the browser on WebGPU, Lesson 1

When Mothers Get Arrested for Mothering

Guifi.net: free, open and neutral, mostly wireless community network

Vega-Altair: Declarative Visualization in Python

DeepSeek Flash reduced price by 100%

We're Sharing a Solution to the Navier-Stokes Millennium Prize Problem

Practical Agentic RAG patterns implemented with LangGraph

I'm Not Reading Your AI-Generated Design Doc

AWS Graviton c8g.large: Tiny 0.04% CPU variation across 3 fresh VMs

ChatGPT Images 2.5

OpenAI Says It Has Solved a Millennium Prize Problem–A Holy Grail of Math

What AI Can't Fake: How junior engineers can stand out in the age of AI

Open-Sourcing Eraser Diagrams

Show HN: Pen – A writing tool where conversation is the editor

Interstellar Scenes Recreated in Three.js