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?

Kubernetes Changed Block Tracking API – Beta Differences

Unexpected Facts about Turkeys

Anyone Used Cloudflare AI Agent Diagnostics for SaaS Purchases?

EconDash – Explore 753 economic indicators across 298 countries

Walking Men Worldwide

Taking notes while reading: the John Locke commonplace method

Infillion Acquires Foursquare

Options Trading – Formula better than the Black-Scholes model

Launched a JEV directory with 100 uses cases

Show HN: NotchBuddy – Your MacBook's Notch Can Do All This

Wonder how smart Jev is? Ask him directly

OwnNotes: Private AI Notebook

Nonprofit that tracks meteors taken down by "critical blow" from a cyberattack

RoboHarm: Do Frontier Robot Policies Refuse Unsafe Instructions?

AnyFilter: Hide anything you don't want to see on any site, powered by Jev

TimeCodeSecurity – Deterministic AST SAST and Auto-Remediation for Python

Show HN: NSLibrary – a self-hosted library for your Switch games and homebrew

Guest to host: escaping Docker's hypervisor

First principles of UI composition for your coding agents

Anthropic sets up biology lab as it ramps AI drug program

Jev Playground

Windowshot

Show HN: Sigabrt.dev – cronjob monitor with an SSH TUI

Laya the open source version of Jev

Would you trade a 6-hour layover for 3 days in that city if it's cheaper?

Search Engine that de-ranks Bot Popup and Cookie Popup websites?

Leave the Class Path in the Rearview Mirror

What Happens If You Execute a Random File? [video]

Claude Fable credit expiring one day earlier than stated

Goosebumps: A Paradigm Shift Is Occurring in Robotics