[remotemass (OP)]

Large random integer = n = ?
(You can use the latest cryptographic hash coming from the bitcoin network in the latest block on its blockchain on average within the next 10-11 minutes. Just hash it with SHA-256 to get rid of the leading zeros on the left and have a large random integer of 256-bits data)

Number of possibilities of next rotations movement = 18 (6 faces. Rotate clockwise or anticlockwise? 90 degrees rotation or 180 degrees rotation? 6 * 2 = 12. And 12 + 6 = 18.

The large random integer can be written using the 26 letters of the English alphabet.

#1 = R = 00000 = English letter "A"

#2 = L = 00001 = English letter "B"

#3 = F = 00010 = English letter "C"

#4 = B = 00011 = English letter "D"

#5 = U = 00100 = English letter "E"

#6 = D = 00101 = English letter "F"

#7 = R' = 00110 = English letter "G"

#8 = L' = 00111 = English letter "H"

#9 = F' = 01000 = English letter "I"

#10 = B' = 01001 = English letter "J"

#11 = U' = 01010 = English letter "K"

#12 = D' = 01011 = English letter "L"

#13 = R2 = 01100 = English letter "M"

#14 = L2 = 01101 = English letter "N"

#15 = F2 = 01110 = English letter "O"

#16 = B2 = 01111 = English letter "P"

#17 = U2 = 10000 = English letter "Q"

#18 = D2 = 10001 = English letter "R"

#19 = R = 00000 = English letter "S"

#20 = L = 00001 = English letter "T"

#21 = F = 00010 = English letter "U"

#22 = B = 00011 = English letter "V"

#23 = U = 00100 = English letter "W"

#24 = D = 00101 = English letter "X"

#25 = R' = 00110 = English letter "Y"

#26 = L' = 00111 = English letter "Z"

 Step 1) To find "m" subtract "i" from "n", when "i" goes from 1 to 26.
 Step 2) When "i" divides "n", go next step. What is "m" now and what is "i" now when we go to next step?
 Step 3) Loop back to step 1 till m is less than 2.

Can this finite number of steps in my own pseudocode language be improved by you?
(We want an easy and simple way to shuffle Rubik's cubes hashing, with SHA-256, the latest hash of the bitcoin network as many times as needed according to how many cubes we want to shuffle at that moment in time.)
 

[remotemass (OP)]

[ REPLY from ChatGPT ] - "Using a large random number generated by hashing the latest block of the Bitcoin blockchain to shuffle a Rubik's cube would not be a simple or easy way to do it, and it would not be easily verifiable by most people. As I mentioned earlier, there are many algorithms available online that can be used to shuffle a Rubik's cube in a random fashion, and these algorithms are much simpler and more efficient than using a large random number generated by hashing the latest block of the Bitcoin blockchain. Additionally, using a large random number generated by hashing the latest block of the Bitcoin blockchain would not be necessary or desirable, as the number of possible states of a Rubik's cube is much smaller than the number of possible values of a 256-bit number."

[Bored chemist]

We want an easy and simple way to shuffle Rubik's cubes hashing, with SHA-256,

Why?

[remotemass (OP)]

We want an easy and simple way to shuffle Rubik's cubes hashing, with SHA-256,

Why?

Most talented magicians performing on a stage or on television are able to convincingly cheat us in a very convincing way in the performance of an extraction of random numbers to shuffle a Rubik's cube well or some other way of randomly shuffling them.
It is unlikely that many others would not be able to do the same and learn how to cheat us as well performing such a fake shuffling as the best magicians in world can certainly do.

Using the random number coming from the Bitcoin network that will be available for any of with access to the internet each time a new block of transactions is created in the bitcoin blockchain and its cryptographic hash using SHA-256 can be found, it is extremely difficult to cheat others on something like this, the snuffling of a Rubik's cube using a random integer.

Cryptographically secure random numbers, such as those generated by the Bitcoin network, can provide a strong foundation for ensuring the fairness and randomness of a shuffling process, such as the shuffling of a Rubik's cube. Because these random numbers are generated using complex mathematical algorithms and cryptographic techniques, it is extremely difficult for anyone to predict or manipulate the outcome of the shuffling process. This can provide a high level of confidence that the shuffling is truly random and fair.

- remotemass

[Bored chemist]

You are planning to do that because you think magicians don't use real magic?

Would you like to think that through again?

[remotemass (OP)]

You are planning to do that because you think magicians don't use real magic?

Would you like to think that through again?

Please don't put words in my mouth like that.
I am not planning to do anything that would make me as silly.

[Bored chemist]

OK, why are you looking at these cryptographic techniques?

[remotemass (OP)]

OK, why are you looking at these cryptographic techniques?

A: You can see a new block it as a block of random data, pretty much like the next number of a magazine that is just random dots on white paper pages, probably someone's favourite magazine, sooner or later ;-)
Let's call that magazine next number, or random block next number: "Big iBits", for the sake of giving it a sound name.

Now, the cryptography is just to get the digital fingerprint of that raw random data. You use a cryptographic hash, and the one you use is the one that Bitcoin uses the most: SHA-256. That's it. Nothing too fancy.

With the random integer number you, after indexing all the possibilities of sequencing the possible next rotations, find the sequence of rotations that will give your new shuffling of your cube. Any questions? Simple.

[Eternal Student]

Hi.

   It all sounds strangely specific in some places and overall quite needless just to shuffle a Rubik's cube.    If you want to shuffle a Rubik's cube randomly, there are many ways you could do that.
   Meanwhile, if your intention is to defeat the Bitcoin system in some way, then I'm not sure we should be helping with that.

Best Wishes. 

[evan_au]

it is extremely difficult for anyone to predict or manipulate the outcome of the shuffling process

You are ignoring the possibility of an "inside job".
- Someone who has access to the source code knows exactly how the shuffle will turn out
- That includes you (remotemass), anyone who has access to your computer, plus anyone who read your description on a public discussion forum
- The Bitcoin hashes are available to the public, and contain the historical hashes in case you want to unscramble one posed a year ago...

You propose a 5 bit code to specify each scrambling move
- That gives 256/5 = 51 moves.
- This algorithm uses only 18 combinations out of 32 possible with 5 bits, throwing away almost half of the randomness
- If you wanted even more moves, you would represent the 256-bit hash in base 18, effectively using all the randomness
- Limiting the world to solving 1 Rubik's Cube every 10 minutes seems a bit restrictive...
- There are random number generators that can generate a new cube every few microseconds,
- Most laptops now have a TPM module, which can generate a random seed for the random number generator
https://en.wikipedia.org/wiki/Trusted_Platform_Module#Overview

But why would you bother?
- I understand that the maximum number of moves to solve a Rubik's Cube is 20 (but many well-scrambled cubes can be solved in 16 to 19 moves)
https://en.wikipedia.org/wiki/Optimal_solutions_for_Rubik%27s_Cube

[Bored chemist]

Any questions?

just 2 questions.
Why go to that much trouble to generate numbers that are not really random?

The RAND function in excel is good enough for most things.

Most talented magicians performing on a stage or on television are able to convincingly cheat us in a very convincing way in the performance of an extraction of random numbers to shuffle a Rubik's cube well or some other way of randomly shuffling them.

What evidence do you have for this?

Maybe they just know how to solve a Rubik's cube.
There are instructions on the web.
I know people who can do it.

[Bored chemist]

Just a  thought.
If you try to follow the prescribed set of moves but make a mistake, will the output be more random, or less?

[evan_au]

If you try to follow the prescribed set of moves but make a mistake, will the output be more random, or less?

There are a relatively few configurations of Rubiks cube that require the full 20 moves to solve: about 300 million of them (out of 43,252,003,274,489,856,000).
- So if you were in one of these "worst case" configurations, the odds are that any random move will get it closer to being solved (ie "less" disordered)
- The same goes for cubes requiring 19 moves to solve.
- But if you have a cube requiring 17 or less moves to solve, the odds are that a random turn will increase the number of moves to solve.

Rubiks_Cube_Moves.png (30.34 kB . 471x587 - viewed 1742 times)
Table from: https://www.quora.com/How-many-permutations-does-a-Rubiks-Cube-have

PS: This thread has an intriguing link to the question in another thread about "Is there a substance where entropy decreases at higher temperature?". Is the answer "Rubik's Cube"?
https://www.thenakedscientists.com/forum/index.php?topic=85931.0

[wolfekeeper]

Is the OP on this thread a bot or only the 'reply' by ChatGPT?