First Issue about HD Key Generation

[linked0]

This is a test for uploading image

[linked0]

How about using the HD Key generation concept?

In the above picture, we can use the children keys of the first child as the seed of a pre-image. One child has 2^31 number of child keys so each height can have the seed or private key for initial pre-image(the random seed described in white paper).

It can solve the related problem that we have to look through all the blocks in order to restore the cycle index for next random seed.

[linked0]

I think saving the pre-image information in the block would the right approach for solving the current issues described above. So, I thought about how to save the pre-image of all validators. Here is my idea but it's kind of different from @AndrejMitrovic 's but we can have a whiteboard session about it.

• We save pre-images into the next block which are only newly published in the current height.
• The structure of the information has the index of a validator, a 16-byte hash of the pre-image, and a distance of the pre-image
  • index of a validator: an index on an ordered list of current validators
  • hash of a pre-image: a pre-image can be shortened with one more hashing resulting in 16 bytes hash
  • distance of a pre-image: this is can be used for proofing the pre-image

[AndrejMitrovic]

Did you post this in the wrong issue?

[linked0]

Did you post this in the wrong issue?

It's just for identifying that the text is represented in the right format. Thanks. :)