Ponder

Ponder is now 10-50x faster during historical indexing

0.4.37 introduces batched database writes & an in-memory cache for frequently accessed records

Apps that use a remote database will be much faster

Before, every store API method (create, findUnique, etc) hit the database

Now, the store uses an in-memory record cache. When the cache gets too big, it flushes the N least recently used records to the database in a single query

Release: github.com/ponder-sh/ponder/releases/tag/%40ponder%2Fcore%400.4.37

Building ponder.sh. EVM, TypeScript, open-source enjoyer.

Our perf goal is <1 minute for most apps, and <1 hour for massive apps (like Uniswap V2 across all chains)

Another 2 orders of magnitude to go 🫡

We're hiring engineers in NYC across all roles - DM if interested!

Chat: t.me/ponder_sh
Docs: ponder.sh/docs/indexing/create-update-records

Steward @ensdao, Building DAO transparency with safenotes.xyz

Open-source web3 dev. Prev CTO Bankless & Founder Earnifi
 🚁  Punk #5305

Time to update our version @limes.eth 😮 👏

Same app on Railway

0.4.37 -> 5m 30s (17x faster)
0.4.36 -> 1h 37m

cc @kjs

1000 $DEGEN

Do you have benchmark numbers for Railway?

Ponder's historical indexing just got a major speed boost! Version 0.4.37 brings significant improvements with batched database writes and an in-memory cache for frequently used data. This means applications reliant on a remote database can expect up to 50 times faster performance when working with historical data.