#### Topic: Problem on cryptography (or under the number theory)

There is some sequence of great numbers of the fixed digit capacity: H0, H1, H2... Numbers look, as pseudorandom, but actually it some data. A question, whether it is possible to count from them something: X = F (H0, H1, H2...), possessing following properties: 1) X has digit capacity (not is mandatory coinciding with digit capacity initial ) 2) Knowing X, for any number H it is possible to define with high confidence figure, whether is H one of H0, H1, H2... It would be ideal, if the probability the answer was 0, and the order 2-128