<oembed><type>rich</type><version>1.0</version><title>KeithMukai wrote</title><author_name>KeithMukai (npub1tv…77wn2)</author_name><author_url>https://nostr.now/npub1tv8gmfhalwnxxquxjzeh6gtdsdz6vg7vx0s3rt7s7uuw6aujh32qn77wn2</author_url><provider_name>njump</provider_name><provider_url>https://nostr.now</provider_url><html>Six possible values don&#39;t fit cleanly into binary math:&#xA;&#xA;2^2 = 4 possible values&#xA;2^3 = 8 possible values&#xA;&#xA;So there are some convoluted schemes to try to stuff the six values into a binary format that just wasn&#39;t meant to accommodate them (see discussions on iancoleman.io&#39;s github repo related to &#34;bias&#34; in terms of fitting into binary data).&#xA;&#xA;But if you instead treat each roll as a character:&#xA;&#xA;The character &#34;5&#34;, not the number 5&#xA;&#xA;Then you express your dice rolls as a text string:&#xA;&#xA;&#34;62446342425241113...&#34;&#xA;&#xA;And feed that string into sha256.&#xA;&#xA;Change any of those rolls at any position and you get a totally different sha256 hash.&#xA;&#xA;So each position in that text string has 6 possible values. And each different value yields a totally different sha256 hash. And the position of those values matters (swapping the 1st and 2nd = totally diff hash).&#xA;&#xA;So assuming that sha256 isn&#39;t broken, you&#39;re providing 6^n amount of unique outcomes, where n is the number of rolls.&#xA;&#xA;In other words: the total space of possible outcomes is exactly as huge as it&#39;s supposed to be.&#xA;&#xA;99 rolls gets you 10^77 possible outcomes (supposedly sha256 loses ~0.5 bit, but okay). With none of the bit-fitting gymnastics.</html></oembed>