#spell #spell-checker #recursion #transaction #validation #charms #proofs

bin+lib charms-spell-checker

Recursive validation of spells creating Charms

15 releases

new 0.3.4 Feb 20, 2025
0.3.3 Feb 7, 2025
0.3.0 Jan 21, 2025
0.2.0 Jan 16, 2025
0.1.10 Dec 31, 2024

#4 in #charms

Download history 119/week @ 2024-12-12 28/week @ 2024-12-19 797/week @ 2024-12-26 213/week @ 2025-01-02 2/week @ 2025-01-09 355/week @ 2025-01-16 16/week @ 2025-01-23 12/week @ 2025-01-30 391/week @ 2025-02-06

774 downloads per month
Used in charms

MIT license

17KB
367 lines

charms-spell-checker is not a spelling checker: it's a validator for spells.

It is run inside a zkVM to produce recursive proofs of correctness for spells — metadata on top of transactions that specifies what charms are created on top of transactions' outputs.

Dependencies

~14MB
~230K SLoC