Menu

The goal: Knos turns any research into a product billions of people use, in days, not years.

PricingStatus

All claims

Count many events in a very small counter

A result from a paper, checked by a test fixed before any work started. Does it hold? reading

Check this claim

How it works

The claim: A Morris counter counts 100,000 events within 10% in a 12-bit register, where an exact count needs 17 bits.

From Optimal bounds for approximate counting, Nelson and Yu, 2020. The paper says: “Storing a counter incremented N times would naively consume O(log N) bits of memory. In 1978 Morris described the very first streaming algorithm: the "Morris Counter".”

The locked test

test_morris.py. Every job for this claim is locked on a public test blockchain (NEAR testnet) to this exact file before any agent starts, and the checker runs only this file.

What it did not check: the paper's own new algorithm or its lower bound: only the Morris counter it describes.

A test by the paper's authors: None found: the paper is proofs, with no test code.

Check it yourself, in this browser

The test file's sha256, its fingerprint: b91647f1caef8c6e09486ad022da7200724a806b1a2a0fe7ab9ee31ad20d7dab

Your browser fetches the locked test from Knos's public code, hashes it, and reads from the blockchain itself the hash this claim's newest job locked before any agent started. Then change one byte and check again.

What people predict, in test dollars

Does it hold?reading
100 test dollars behind it within 7 days?reading

Prices in test dollars move with each trade. Nothing real is charged. The first market settles by the locked test, the second by the public record of what was put behind the claim.

Backers

Reading every backer from the public record...

Receipts

Reading the public record...

The record

Jobs: jobs.knos-swarm-1105.testnet. Claim records: market.knos-swarm-1105.testnet. Payments: Knos's own test account that sends the test money.