oda

Fast JSON parser/writer for Clojure. Zero dependencies, JDK 25+.

oda is fast, low-allocation, and correct: it outperforms Jackson-backed libraries (jsonista, cheshire) on every workload we bench, read and write, allocates 2-5x less per operation, and is validated against the full JSONTestSuite corpus with bit-exact double parsing and writing (see Correctness).

Enabling the (incubating) Vector API adds SIMD string scanning for an extra boost on string-heavy documents — see Optional SIMD.

Status: alpha. API may still move.

Installation

Requires JDK 25+. The jar ships the compiled Java core; when working from a git checkout instead, compile it once with clj -T:build javac.

Usage

(require '[s-exp.oda :as oda])

;; parse: byte-array, String or InputStream
(oda/parse "{\"a\":1,\"b\":[1.5,true,null]}")
;; => {"a" 1, "b" [1.5 true nil]}

(oda/parse "{\"a\":1}" {:key-fn keyword})
;; => {:a 1}

(oda/parse "{\"first-name\":\"Ada\"}"
           {:key-fn #(keyword (clojure.string/replace % "-" "_"))})
;; => {:first_name "Ada"}

;; write
(oda/write-str {:a 1 :b [1.5 true nil]})
;; => "{\"a\":1,\"b\":[1.5,true,null]}"

(oda/write-bytes {:a 1})            ;; => byte[]
(oda/write {:a 1} output-stream)    ;; progressive, bounded memory

Options

parse:

option	default
:key-fn	nil	fn of String -> key applied to object keys; nil keeps strings. clojure.core/keyword is recognized and takes an optimized interning path. Must be pure: results are cached by fn identity
:max-depth	1000	maximum nesting depth (stack-overflow/DoS guard)
:max-number-length	1000	maximum length of a number token in chars; converting huge numbers to BigInteger/BigDecimal is superlinear (DoS guard)
:bigdec	false	read non-integer numbers as exact BigDecimals instead of doubles

A leading UTF-8 byte order mark is skipped. Invalid input throws com.s_exp.oda.JsonParseException; its ex-data is {:offset <byte offset> :line <1-based> :column <1-based, in characters>}.

write-str / write-bytes / write:

option	default
:default-fn	nil	called on values that cannot be written natively — unsupported types AND supported types with unrepresentable values (NaN/Infinity Float/Double). Must return a natively writable value: it is not applied again to its own result (values nested inside it do get it). Without it those cases throw. NaN/Infinity map keys go through it too, its result being written as a key
:key-fn	nil	transforms each map key before dispatch. Use to handle nil keys, custom types, or normalize keys. Takes the key, returns any writable key (String, Keyword, Symbol, Number, UUID, Boolean, Character, Enum)
:max-depth	1000	maximum nesting depth; deeper (or cyclic) values throw instead of overflowing the stack
:date-format	yyyy-MM-dd'T'HH:mm:ss'Z' (UTC)	format for java.util.Date/java.time.Instant values: a pattern string or a DateTimeFormatter (zone-less formatters default to UTC)

Supported types (write)

Maps (keys: keyword, string, symbol, number, UUID, boolean, char, enum), vectors, sets, seqs, java.util.Map/Iterable, Java arrays (byte[] as a base64 string and char[] as a string, like Jackson), strings, keywords, symbols, chars, UUIDs, Java enums (by name), java.util.Date/java.time.Instant (see :date-format), other java.time values as ISO-8601 strings (zoned date-times with their offset), all JVM numbers (Ratio written as double), booleans, nil. NaN/Infinity throw unless :default-fn is provided.

Hostile input

parse is safe to expose to untrusted input; every guard fails with a JsonParseException:

• nesting depth and number length are bounded (:max-depth, :max-number-length); huge numbers would otherwise cost superlinear BigInteger/BigDecimal conversions
• objects with more than 64 keys reject crafted hash collisions (more than 16 distinct keys sharing one hash), which would otherwise make building Clojure's PersistentHashMap quadratic: 50k colliding keys take ~10s unguarded. Duplicate keys are not collisions
• key caches retain at most 64 bytes per key, so hostile keys cannot pin memory
• malformed UTF-8 (including overlong forms such as C0 AF for /) is replaced with U+FFFD, never decoded leniently

Document size is the caller's to bound (e.g. request body limits): parse reads its whole input into memory.

Performance

JMH (forked, average time, gc-profiled), Apple M-series, JDK 25, keyword keys. All multipliers are oda's speedup relative to jsonista (Jackson); higher is better, below 1.0x jsonista is faster. SIMD columns have the Vector API enabled (see below).

payload	read	write	read (SIMD)	write (SIMD)
number-heavy	2.4x	1.3x	2.3x	1.2x
citm_catalog	1.9x	2.5x	1.9x	2.6x
small objects, repeated keys	1.8x	1.1x	1.8x	1.2x
long ASCII strings	1.5x	1.1x	3.6x	5.0x
twitter.json	1.2x	1.9x	1.2x	2.1x
string-heavy (raw UTF-8)	1.1x	1.1x	1.4x	1.1x
string-heavy (\uXXXX escapes)	1.0x	1.2x	1.0x	1.1x

Jackson's escaped-string writer is bimodal across JVM forks (~1.5ms or ~4ms per op on the string payloads); the ratios above use its fast mode.

oda also allocates 2-5x less than jsonista per operation on most payloads (e.g. citm read: 1.4MB vs 7.9MB per op). Writes allocate nothing beyond the returned array (numbers included, via a Ryū port). Reproduce with:

clj -M:jmh quick vector    # or: full, scalar, plus payload/benchmark names

Optional SIMD

With the (incubating) Vector API enabled, string scanning and encoding go 16 bytes at a time.

Enable with:

clj -J--add-modules -Jjdk.incubator.vector ...

Without the module oda silently uses its scalar (SWAR) paths. -Doda.vector=false forces scalar.

Correctness

• full JSONTestSuite corpus (all y_/n_/i_ cases)
• differential testing against jsonista on the corpus and on generative payloads (test.check)
• doubles are correctly rounded on both sides: Eisel-Lemire parsing and Ryū writing, validated bit-exact against Double/parseDouble on torture values plus thousands of generated round-trips
• write→parse round-trip properties on random Clojure structures
• duplicate object keys: last wins

Design notes

• single-pass parser over byte[], fused tokenizer/builder, no token objects
• SWAR (8-byte) string scanning, optional 16-byte SIMD via Vector API
• object keys canonicalized through fixed-size lossy caches (no locks, no thread-locals, bounded memory, virtual-thread friendly)
• PersistentArrayMap built directly for small objects, transient PersistentHashMap above 8 keys
• numbers: inline long accumulation; doubles via a fused Eisel-Lemire conversion (ported from FastDoubleParser, MIT)
• writer: flat instanceof dispatch, pre-escaped key fragment caches, pair-table long rendering; streaming writes flush a 64KB buffer

License

Copyright © Max Penet. Distributed under the Mozilla Public License 2.0 (see LICENSE).

EiselLemire.java is ported from FastDoubleParser, Copyright © Werner Randelshofer, MIT License. RyuDouble.java is adapted from ryu, Copyright © Ulf Adams, Apache License 2.0.