Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

nine_k•8mo 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•8mo ago

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

tlb•8mo 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•8mo 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•8mo 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•8mo ago

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

It looks like the status/need-triage label was removed

Interfaces and Traits in C

Quantum effect observed for biggest objects yet

GPT Style Models Tokenize Text for Training (With Code)

Apple's New AI Strategy Firms Up Under Craig Federighi

Bags.fm: Weaponizing the 'Build in Public' Community

Data Oriented Programming, Beyond Records

Announcing winapp, the Windows App Development CLI

Dyalog and AI [video]

A socratic dialogue over why drugs work at all

Everyone else is ahead of me, so I decided to build in public

Job Applicants Sue to Open 'Black Box' of A.I. Hiring Decisions

Show HN: VibeFarm – A non-generative IDE for composing AI prompts

Show HN: Open-source-ish chart pattern detection using Gemini Vision API

Show HN: Bible translated using LLMs from source Greek and Hebrew

Huatuo: A cloud-native operating system observability project based on eBPF

Jan – Open-Source ChatGPT Replacement

Lifestyle Anarchism

Generalized EARS: The AI-Ready Spec Syntax

SFPark: Interactive map of SF parking regulations

Townie's Back in Town

Society for Creative Anachronism

GitFolio – Turn Your GitHub into a Portfolio

The Craftsman's Case for AI

First observation of flexible use of a tool by cow [video]

Vertical Large Model for the General Agricultural Domain

AI Is Not Just a Writing Tool, but Your University's AI Plan Is Probably a PDF

Why streaming compression breaks binaural beats

Show HN: I built an iOS app with all 5 major AI models for $13/mo

JOL (Java Object Layout) is the tiny toolbox to analyze object layout in JVMs