Nicheloom

Market intelligence for builders — see what's gaining traction before it's crowded.

Hekate

A Zero-Copy ZK Engine Overcoming the Memory Wall

Details

External ID
46664650
Source
HN
Company
—
Product
—
Website domain
—
Launched
Jan. 18, 2026
Cohort
—
Upvotes
8
Upvotes percentile
0.41699604743083
Tags
—
Fetched at
Sept. 7, 2026, 9:25 p.m.
Updated at
Sept. 7, 2026, 9:25 p.m.

Description

Most ZK proving systems are optimized for server-grade hardware with massive RAM. When scaling to industrial-sized traces (2^20+ rows), they often hit a "Memory Wall" where allocation and data movement become a larger bottleneck than the actual computation.I have been developing Hekate, a ZK engine written in Rust that utilizes a Zero-Copy streaming model and a hybrid tiled evaluator. To test its limits, I ran a head-to-head benchmark against Binius64 on an Apple M3 Max laptop using Keccak-256.The results highlight a significant architectural divergence:At 2^15 rows: Binius64 is faster (147ms vs 202ms), but Hekate is already 10x more memory efficient (44MB vs ~400MB).At 2^20 rows: Binius64 hits 72GB of RAM usage, entering swap hell on a laptop. Hekate processes the same workload in 4.74s using just 1.4GB of RAM.At 2^24 rows (16.7M steps): Hekate finishes in 88s with a peak RAM of 21.5GB. Binius64 is unable to complete the task due to OOM/Swap on this hardware.The core difference is "Materialization vs. Streaming". While many engines materialize and copy massive polynomials in RAM during Sumcheck and PCS operations, Hekate streams them through the CPU cache in tiles. This shifts the unit economics of ZK proving from $2.00/hour high-memory cloud instances to $0.10/hour commodity hardware or local edge devices.I am looking for feedback from the community, especially those working on binary fields, GKR, and memory-constrained SNARK/STARK implementations.

Enrichment

Theme
lightweight and on-device AI runtimes
Vertical
Horizontal
Function
Model & infra
Audience
Developer
AI stance
Not AI
Project type
Commercial product
Normalized one-liner
zero-copy zk proof engine
Manually corrected
False

Could you build this?

No Building a zero-copy Zero-Knowledge proof engine that solves memory-wall bottlenecks for million-row traces requires world-class cryptography research, custom polynomial commitment schemes, and extreme low-level systems/hardware optimization.

What it would actually take: A production implementation requires a systems programming language (Rust/C++) implementing custom Plonkish or STARK arithmetization with custom finite field and elliptic curve primitives. The hard parts are cache-oblivious algorithms, custom memory allocators to eliminate OS memory fragmentation, streaming polynomial evaluations, and memory-mapped zero-copy FFT/MSM pipelines. This requires rare expertise in advanced zero-knowledge proof cryptography combined with low-level kernel and memory architecture performance engineering.

Discussion

10 comments analyzed.

Competitors mentioned: Binius64, Other ZK proving engines (general category)

Concerns raised: Memory requirements exclude permissionless proving on commodity hardware, Academic protocols don't translate to practical hardware-aware implementation, Current ZK infrastructure assumes 64-128GB RAM, centralizing proving power

Feature requests: Zero-copy streaming model for large-scale row evaluation, Cache-locality optimization for CPU L1/L2 instead of memory bus saturation

Competitors

Other products that read as similar to this one — 119 launches clear the similarity bar, closest 8 shown.

Attention rank: #72 of 120 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).

Launched 72 days after the earliest competitor.

Other launches for this product

Same idea, different domain

Nobody's really built a model & infra tool for Fintech yet.