{"commitment":"fc912c19c140c190ca0eefbfc272adfab1d1354aeb99cedeef457fe58b4c6fbd","salt":"000000000000000000009d09e903d8b91cda458bf8928631b1885dfbc90872dc","developmentSalt":false,"saltBlockHeight":967471,"roundsRemaining":199964,"houseEdge":0.03,"maxMultiplier":25000,"bonusStepEvery":12,"goldRoundEvery":10,"goldStepEvery":4,"growthRatePerMs":0.00006,"algorithm":{"chain":"seed[i+1] = SHA256(hex text of seed[i]); rounds consume the chain backwards","digest":"HMAC_SHA256(key = salt, message = seed)","crashPoint":"u = first 52 bits / 2^52; crash = floor(100 * (1 - houseEdge) / (1 - u)) / 100, min 1.00","ladder":"rungs from the commitment: step i+1 = step i + round(step i * U(0.04, 0.11), 0.01), first step U(0.01, 0.04); one rung in bonusStepEvery triples instead, never the first; a round pays the highest rung at or below its crash point","goldRounds":"every goldRoundEvery-th round by count uses goldStepEvery in place of bonusStepEvery, so its ladder is denser; a count and not a draw, because the chain is consumed backwards and nothing past the next round is knowable. The density a round ran on is published with that round and must be used to rebuild its ladder. Return is unchanged: reaching x has probability (1 - houseEdge)/x whatever the ladder looks like"}}