{"generator":"patterns.wfc","version":1,"value":{"algorithm":"wfc","width":960,"height":640,"sample":{"key":"knot","rows":["000121000","000121000","000121000","111111111","222222222","111111111","000121000","000121000","000121000"]},"n":3,"symmetry":8,"cols":70,"rows":47,"palette":["#440154","#269089","#fde725"],"grain":0.01,"grain_seed":323540756,"seed":3353377385},"display":"Knot \u00b7 N = 3 \u00b7 8 symmetries \u00b7 70\u00d747 cells","meta":{"palette":["#440154","#269089","#fde725"],"sample":"Knot","sample_size":"9\u00d79","window":"3\u00d73","symmetry":"8 symmetries","cells":3290,"patterns_before_dedup":648,"output_is_periodic":false,"note":"Two cords crossing, one passing over the other. The output is a woven net: the solver has inferred that a cord may run straight, may cross, and may not simply stop. The output has edges rather than wrapping: a periodic output would impose a global constraint that no assignment can always satisfy \u2014 diagonal stripes of period four cannot close up around a grid 74 cells wide \u2014 and the solver would spend its whole budget discovering that.","stream_bytes_used":8,"rejections":0,"entropy_in_bytes":16,"duration_us":58},"receipt":{"source":"csprng","source_label":"Operating System CSPRNG","class":"A","class_label":"Cryptographic","caveat":null,"narrative":"Drawn from the kernel entropy pool on the server that rendered this page. (The source you picked was unreachable, so we fell back to the kernel.)","proof_url":null,"reference":null,"observed_at":"2026-09-14T18:02:31+00:00","degraded":true,"mixed_with_csprng":false,"latency_ms":1498,"cached":false},"seed":{"token":"R23WFVJ4H31RWRX5GGEEWKHQW0","permalink":"https:\/\/randomly.cluxnei.dev\/r\/R23WFVJ4H31RWRX5GGEEWKHQW0?g=patterns.wfc&v=1&p=eyJncmFpbiI6MC4wMSwiaGVpZ2h0Ijo2NDAsIm4iOjMsInBhbGV0dGUiOiJ2aXJpZGlzIiwic2FtcGxlIjoia25vdCIsInN5bW1ldHJ5IjoiOCIsInRpbGVzIjo3NCwid2lkdGgiOjk2MH0&s=csprng"},"render_key":"4d0f849a6efefd172a462a404c96a6b4da19c5b97f4a4bb516880ad9f726f549","uses_entropy":true,"reproducible":true}