TECHNOLOGY PREVIEW · C++23 · HIGH-PERFORMANCE INFRASTRUCTURE

ὕλη

HYLE

Θεῶν δημιούργημα

Divine Craft

Built for AI inference, resource streaming and low-latency services. Measured wins against SOTA performance libraries across 18 equivalent workloads.1

BENCHMARKED AGAINST SOTA

The best libraries. A higher bar.

Highway, Boost.Beast, Abseil, Folly, oneTBB: SOTA libraries built around performance. HYLE goes head to head with them under equivalent functionality and semantics, with 18 wins across key workloads.

18external benchmark wins

SIMD

Peak advantage

7.463×

SIMD sorting

VQSort partial / full sorting

vs. Highway VQSort

1.147–7.463×

io-http

Peak advantage

3.065×

HTTP streaming

Fragmented HTTP/1 streaming lifecycle

vs. Boost.Beast

3.030–3.065×

io-websocket

Peak advantage

3.354×

WebSocket masking

WebSocket masking, 124 B–1 MiB

vs. Boost.Beast

2.005–3.354×

sched

Peak advantage

1.663×

Request scheduling

Request fan-out + collect on four P-cores

vs. Marl

1.646–1.663×

Each headline is the upper end of the range for its stated workload and reference implementation.

These implementations are already highly optimized. Even a few percentage points of further improvement matter. From incremental gains to multiples, every result below keeps its workload, competitor and full reported range in view.

Full performance comparison · 18

Scroll horizontally to see each workload, reference and result.

HYLE external benchmark wins under equivalent functionality and semantics
ModuleWinning workloadReference implementationHYLE advantage
container-intrusiveNon-owning list: stable sort + mergeBoost.Intrusive1.088–1.119×
util-coreBound-member FunctionRef traversal callsAbseil FunctionRef1.245–1.264×
errorOwning failure, first-error, Join failure, Result<T&> borrowAbseil Status/StatusOr1.21–4.78×
timer-queueComplete lifecycle of 64 timersSeastar timer queue1.129–1.190×
mem-reclaimImmutable snapshot reclamation readFolly reclamation1.365–1.381×
memLogical range allocator: alignment, split, coalesce, ownershipOffsetAllocator, equivalent-contract adapter1.031–1.043×
mem-vmModel-loader virtual range lazy releasellama.cpp vector rebuild route1.031–1.047×
SIMDVQSort partial / full sortingHighway VQSort1.147–7.463×
containerModel-cache LRU: lookup, insert, weight evictionAbseil adapter1.222–1.273×
container-queueUnbounded typed MPMC, 4 producers / 4 consumersoneTBB queue1.261–1.289×
container-textBase64 encoding of small 20-byte recordssimdutf1.033–1.045×
schedRequest fan-out + collect on four P-coresMarl1.646–1.663×
schedCompletion wakeMarl1.0266–1.0285×
io-httpFragmented HTTP/1 streaming lifecycleBoost.Beast3.030–3.065×
io-tlsVerified asynchronous TLS handshakeAsio, same OpenSSL1.099–1.102×
io-http264-stream small-response multiplexing + flow controlnghttp21.466–1.478×
io-transfer64 MiB HTTP Range resume + verificationlibcurl1.206–1.247×
io-websocketWebSocket masking, 124 B–1 MiBBoost.Beast2.005–3.354×

ENGINEERING BEHIND THE PERFORMANCE

Performance with the whole system in mind.

Memory, containers, SIMD, scheduling and I/O share allocator, error and lifecycle conventions. Build on a coherent foundation and spend less time reconciling separate subsystems.

Cancellation has a complete lifecycle.

Cancellation, timeouts, late completions and resource release have explicit ownership rules. Async work has a defined path through completion, draining and shutdown.

Keep resources under your control.

Inject allocators, set queue capacities and apply memory quotas. Backpressure and allocation failures have explicit outcomes that the application can handle.

Test the paths where things go wrong.

Validation covers malformed input, allocation failures, concurrency races and complete flows across public APIs, using fuzzing, fault injection and memory and thread sanitizers.

Bring only what you need.

Choose components through a single dependency graph, with locked third-party versions and offline builds. Independent consumer projects check public interfaces and integration boundaries.

TECHNOLOGY PREVIEW

More to come.

HYLE is under active development. Details of its future release and availability will be announced later.