Solana devnet · Record
step 5 approximate
Find a short nonzero vector z with A·z = 0 mod q. The hard problem under lattice signatures.
Scheduled
- Prize
- Record level, no prize
- Estimated cost
- $356,209 on CPU2⁶⁷·⁴ work, estimated, not benchmarked
- Opens
- At launch
- Commitments
- 0
The instance
Derived from the hash of a slot committed when the level opens. Anyone can recompute every value below from the spec and the chain.
- Level id
- 0x9b45146552509f6420e32bc6b3c9746431d61cbef348ce5a8236c9589b02c7c6
- Seed
- not yet sealed
- Shape
- A is 256 × 512 over Z_q
- q
- 2147483647
- Bound on ‖z‖²
- 7507835448944
- Matrix
- coef(k) from keccak256("SHORLINE/v1/sis/A" ‖ seed ‖ u32(k/4)), spec 4.1
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
This level is not open yet.
Claims open when the level is sealed from its committed slot. You will commit and reveal with any Solana wallet.