Interactive

STARKDB Lab

Learn, experiment, and practice STARKDB commands in a live browser environment. No installation needed.

Terminal

stark_cli mydb — STARKDB Lab Session

Explorer

Database is empty. Try a command like:
addn 1 "Hello" or demo

STARKDB uses a B-Tree index for O(log n) lookups. Each internal node holds up to 5 keys (degree 3). Insert keys to see how the tree splits and grows.

Type a string to see its djb2 hash

String keys in STARKDB are hashed using the djb2 algorithm. The result is a uint32 that maps to a numeric B-Tree key. This means all string lookups are O(log n).

Quick Commands

Feedback

Questions or Feedback?

Found a bug in the lab? Have a suggestion? Let us know.

✉ [email protected]