BNB testnet · Record

step 1 approximate

Find a short nonzero vector z with A·z = 0 mod q. The hard problem under lattice signatures.

Open
Prize
Record level, no prize
Estimated cost
under $1 on CPU2⁴⁵·² work, estimated, not benchmarked
Opened
Oct 19, 2026 · 3 h ago
Expires
Oct 16, 2036
Commitments
0

The instance

Derived from the hash of block 137,680,545. Anyone can recompute every value below from the spec and the chain.

Level id
0xb529f9c8f020d6424a76ed6b3f5b4b98b4480535e5f6f786803baec23c91753a
Seed
0xdd0e0bcffb4ef2070eeb229b89e47cdaf084a7efde93c975d8cfc1eaeecbc19e
Shape
A is 256 × 512 over Z_q
q
2147483647
Bound on ‖z‖²
433286012547224
Matrix
coef(k) from keccak256("SHORLINE/v1/sis/A" ‖ seed ‖ u32(k/4)), spec 4.1
Contract
0xceE960…faf856

Claim

Solved it? Check the answer here, then commit and reveal. The reference solver and the spec are in the method notes. How to solve

  1. 1

    Connect a wallet

    No browser wallet found. Any EIP-1193 wallet works, on BNB testnet.

  2. 2

    Check your solution

    Checked in your browser against the live instance. Nothing is sent until you commit.

  3. 3

    Commit

    Publishes a fingerprint of your solution bound to your payout address. Nobody can read the solution from it, and copying it would still pay you.

  4. 4

    Reveal, then get paid

    Reveal once your commitment is 3 blocks old. The earliest commitment with a valid reveal is paid after a …-minute settlement window.

Your salt is kept in this browser and in the receipt file. Without it a commitment cannot be revealed. Every claim from this browser is listed under My claims.

History

Every event for this level, from the contract.