pure/docs/design/020-computing-faster.md, branch masterVerified execution runtime unifying state, persistence, and replication.
http://git.yeowoo.org/pure/atom?h=master2026-10-04T20:52:47ZSay 020 is built and measured (121, 122)2026-10-04T20:52:47Zeunhhunecpition205@gmail.com2026-10-04T20:52:47Zurn:sha1:97f8d04b12744d565c36752f5565d1914daf4c9dCompute views with a body on view workers, off the connection threads, asked and pushed (020)2026-10-04T17:30:43Zeunhhunecpition205@gmail.com2026-10-04T17:30:43Zurn:sha1:6fda961e835527de2aac7d91e8a84fb7ae710327
- pure-serve --view-workers N (a CPU each; 0: on the connection threads):
a GET of a view with a body (or a table with such a column) goes to the
workers, which show it from the app's newest snapshot on readers of
their own and give the answer back as an owner does (eventfd). The
connection thread reads and writes its other connections meanwhile.
- A snapshot of another module than the request was resolved with, or
none (the app stopped), answers 503 stopped. Past an app's queue=N of
them, 503 busy.
- A push group of such a view hands one evaluation at a time; a newer
snapshot meanwhile is evaluated after it; a group whose subscribers all
left stays until its evaluation is back.
- check.py server_view_workers: 8 askers of a long view while its app
changes module (another view in its place) and then goes: every answer
the old module's, the new one's, 503 or 404; streams closed at once
leave nothing; --view-workers 0 as before.
Keep one finger a thread, as before: four cost the bank's queries instructions and a search no time (020)2026-10-04T17:17:28Zeunhhunecpition205@gmail.com2026-10-04T17:17:28Zurn:sha1:d46911e04f130c2a7e8eda8ab3c71bc385737206Search an event's keyed lists by a key set and lists by fingers, add by key in one descent, and loop without recursion (020)2026-10-04T16:39:18Zeunhhunecpition205@gmail.com2026-10-04T16:39:18Zurn:sha1:602780a58c3286d6843e8ff89bd7a3093891a7ad
- An event's list keyed by a number keeps its keys beside its tree: bits
while they are small whole numbers, else an open-addressing table;
has() reads only that, and inserts, removes, key changes, their undoing
and clears keep it.
- Each thread keeps fingers on the last four leaves it read (list id and
version must match): reads by position and searches by key that land in
them do not descend.
- pure_list_add finds a key's place and inserts there in one descent; a
stored keyed list's appends take it too, journaled as inserts.
- Child searches count over the whole guide; item fields know at load
whether they are text; loops run on a stack of loop records, not by
recursion; module-list.c builds at -O3.
- test-module: the key set and fingers answer as a model at every step
(bits to table, removes inside runs, undone changes, clears, shares),
and a stored keyed list's adds replay from its journal.
Say where a search's time goes and how to make it and long views fast, with criteria (020)2026-10-04T15:53:54Zeunhhunecpition205@gmail.com2026-10-04T15:53:54Zurn:sha1:e6bd261b845f5b88d454d0ddaf0b11c12a76e25d