weird secquence

[ecdsa123]

I have a weird sequence -> is anybody smart to find the pattern for this?
a0 is first element in sequence and so on.

how to take index for searching example : 60730954188027216046258787068258904013610447813898304297373912116496774227312 should print : index 7 but without brute forcing.

If any one want payment : I can an offer $1000 for solution.

Code:

p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

a0= 102292441076079717484810683648744116131775059853544164836559860322781770096707
a1= 88623266481613399673767973091353305678132819168188189993765030700404539747913
a2= 106802297905882620833685940484058071063159892838114748087458887750497236026847
a3= 74694934814039498706641344433732274435666694037759340021876651325085619003986
a4= 109921976555621685989390268337665745151602719922850952087883566778678297936728
a5= 61714518888915788842639106782046160979586141447626821985563170371278006577969
a6= 46353530330936789073249433509150722965556667043965055879245601987354590770094
a7= 60730954188027216046258787068258904013610447813898304297373912116496774227312
a8= 71531601248828548888418308358567450495028163879799275729080105411387271583291
a9= 12706325682556999607925301220021219004059260032818735865503495886799599028771
a10= 48294150865494232240432673378206913605438919204964150942241602584344949482790
a11= 86980899862640581217862638137715687209462450489661999289419174790674630602225
a12= 64428498966069198744729370163974215002891411088003334813919324906805683610420
a13= 73988208995277934322845745292477890213240607435243441783191380427850989289746
a14= 34995176481306044545793007198303006042802131282574651399255546817248125353629

[1714256271]

1714256271

[BlackHatCoiner]

What are those numbers? You can't just give an array of numbers and expect us to find patterns.

[apogio]

I have a weird sequence -> is anybody smart to find the pattern for this?
a0 is first element in sequence and so on.

how to take index for searching example : 60730954188027216046258787068258904013610447813898304297373912116496774227312 should print : index 7 but without brute forcing.

If any one want payment : I can an offer $1000 for solution.

Code:

p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

a0= 102292441076079717484810683648744116131775059853544164836559860322781770096707
a1= 88623266481613399673767973091353305678132819168188189993765030700404539747913
a2= 106802297905882620833685940484058071063159892838114748087458887750497236026847
a3= 74694934814039498706641344433732274435666694037759340021876651325085619003986
a4= 109921976555621685989390268337665745151602719922850952087883566778678297936728
a5= 61714518888915788842639106782046160979586141447626821985563170371278006577969
a6= 46353530330936789073249433509150722965556667043965055879245601987354590770094
a7= 60730954188027216046258787068258904013610447813898304297373912116496774227312
a8= 71531601248828548888418308358567450495028163879799275729080105411387271583291
a9= 12706325682556999607925301220021219004059260032818735865503495886799599028771
a10= 48294150865494232240432673378206913605438919204964150942241602584344949482790
a11= 86980899862640581217862638137715687209462450489661999289419174790674630602225
a12= 64428498966069198744729370163974215002891411088003334813919324906805683610420
a13= 73988208995277934322845745292477890213240607435243441783191380427850989289746
a14= 34995176481306044545793007198303006042802131282574651399255546817248125353629

Give us some context man. Otherwise there is no value behind this post. Nobody will just start trying to solve this puzzle even if you say that you offer 10 BTC

[ecdsa123]

This is not puzzle. I need a little math helping with sequence.

I do not know what is the pattern to make generate this:)

I need it to my test which I implement my own trained AI.

max I can pay $10000 
 

[stwenhao]

You can't just give an array of numbers and expect us to find patterns.

Exactly, random in, random out. You can try to be lucky and check OEIS, but if you expect a random response, then here you are: https://bitcointalk.org/index.php?topic=5407344.0

I need it to my test which I implement my own trained AI.

Try to ask any AI about things like block hashes, transaction hashes, or any kind of math, like multiplying some 32-bit number by itself. You would be surprised, how random will your results be.

[ABCbits]

I tried Wolfram Alpha pattern finder[1], but it unable to show any "Possible sequence identification".

I need it to my test which I implement my own trained AI.

If your AI is LLM (such as ChatGPT), don't forget it's bad when number is involved. ChatGPT sometimes fail at simple basic.

[1] https://www.wolframalpha.com/widgets/view.jsp?id=d9976f1c2c0c972d1cee0c3647cbd194

[ecdsa123]

ok. I thing the curves can have vulns.

so : I decided change the curve parameters like below:

Code:

p=75223
n=74929
E = EllipticCurve(GF(p), [0, 7])

G= E.point((20668 ,25411 ))

later I create the sequence with checking how much I must multiply the value of sequence to get next sequence:

how to read
        seq value  multipler   next sequence
seq 0 23728 * 49108 %n 13745

Code:

seq 0 23728 * 49108 %n 13745
seq 1 13745 * 24486 %n 53931
seq 2 53931 * 49283 %n 74914
seq 3 74914 * 4207 %n 11824
seq 4 11824 * 765 %n 53880
seq 5 53880 * 66562 %n 33833
seq 6 33833 * 32856 %n 45333
seq 7 45333 * 4410 %n 7958
seq 8 7958 * 27460 %n 33716
seq 9 33716 * 35330 %n 39967
seq 10 39967 * 26010 %n 51653
seq 11 51653 * 50254 %n 4515
seq 12 4515 * 69360 %n 32109
seq 13 32109 * 28532 %n 52034

so I wanted know that those values are constant
then I little changed my algorithm for new sequnce.. ->

Code:

seq 0 47456 * 49108 %n 27490
seq 1 27490 * 24486 %n 32933
seq 2 32933 * 49283 %n 74899
seq 3 74899 * 4207 %n 23648
seq 4 23648 * 765 %n 32831
seq 5 32831 * 66562 %n 67666
seq 6 67666 * 32856 %n 15737
seq 7 15737 * 4410 %n 15916
seq 8 15916 * 27460 %n 67432
seq 9 67432 * 35330 %n 5005
seq 10 5005 * 26010 %n 28377
seq 11 28377 * 50254 %n 9030
seq 12 9030 * 69360 %n 64218
seq 13 64218 * 28532 %n 29139

hmm. those value are constatnts. this can be suggest that some curve can have...hidden layer:)

[digaran]

hmm. those value are constatnts. this can be suggest that some curve can have...hidden layer:)

I failed to see the constants, all your values are dynamic.
Can you clarify about this hidden/back door, on which curves have you found such layers?

[vjudeu]

Code:

p=75223
n=74929
E = EllipticCurve(GF(p), [0, 7])

Your example is much weaker than secp256k1, not only because you use small numbers. It is weaker, because the greatest common divisor of (p-1) and (n-1) is 42, while in secp256k1 it is only 6. Also, because p-value and n-value can be sometimes combined, and because you use b=7, that greatest common divisor, equal to 42=6*7 is a bigger weakness, because not only you can apply the same attacks, as in secp256k1, and calculate famous six points to get private key in 2^128 steps, instead of 2^256. In your example, you can also attack by using 7, and because your curve equation is y^2=x^3+7, then imagine what would happen if you start picking (x,y) pairs, where both numbers are divisible by 7.