Bitcoin Forum
November 18, 2026, 11:13:46 AM *
News: Latest Bitcoin Core release: 32.1 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 ... 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 [704]
  Print  
Author Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it  (Read 418359 times)
fecell
Jr. Member
*
Offline

Activity: 203
Merit: 2


View Profile
November 10, 2026, 08:24:01 AM
 #14061

Soon I will publish code that clearly demonstrates the kangaroo algorithm.
Baby-Step Giant-Step (BSGS):
Solves g^x = h in a cyclic group of order n, or x in an interval of length N.

Precompute baby steps g^j for j = 0..m-1 in a hash table.

Compute giant steps h * (g^-m)^i and look for a match.

Time O(sqrt(N)), memory O(sqrt(N)).

Deterministic; works for any generic group.

Pollard's Kangaroo (Lambda) Algorithm:
Solves g^x = h when x is known to lie in an interval [a,b].

Uses a tame kangaroo starting at g^b and a wild kangaroo starting at h.

Both jump by pseudorandom exponents; a collision reveals x.

Expected time O(sqrt(b-a)), memory O(1).

Probabilistic; needs a bounded interval.

Key difference: BSGS is deterministic and memory-heavy; Kangaroo is probabilistic, constant-memory, and interval-based.

MITM Algorithm:
Large and small circle reduce range constantly till solution not found. (not public available, get all free RAM/VRAM, tested only with known PK, so far, MITM has not been used to solve any truly complex puzzle, need powerful hardware)
fecell
Jr. Member
*
Offline

Activity: 203
Merit: 2


View Profile
November 10, 2026, 08:41:36 AM
 #14062

Code:
==========* FOUND!=========
[Launch 58] Total:93, 415, 538, 688 koys | Rate: 377.25 M keys/s | Elapsed: 4.3s

Code:
Device Name:                NVIDIA GeForce GTX 1650 Ti
FOUND VERIFIED SOLUTION:
PRIVATE KEY:      1,003,651,412,950
SEARCH TIME:      00:00:02
probes_done:      536870912 (0.0977% of sweep)
Roll Eyes
demonarcher360
Newbie
*
Offline

Activity: 12
Merit: 0


View Profile
November 10, 2026, 11:46:23 AM
 #14063

Soon I will publish code that clearly demonstrates the kangaroo algorithm.
Baby-Step Giant-Step (BSGS):
Solves g^x = h in a cyclic group of order n, or x in an interval of length N.

Precompute baby steps g^j for j = 0..m-1 in a hash table.

Compute giant steps h * (g^-m)^i and look for a match.

Time O(sqrt(N)), memory O(sqrt(N)).

Deterministic; works for any generic group.

Pollard's Kangaroo (Lambda) Algorithm:
Solves g^x = h when x is known to lie in an interval [a,b].

Uses a tame kangaroo starting at g^b and a wild kangaroo starting at h.

Both jump by pseudorandom exponents; a collision reveals x.

Expected time O(sqrt(b-a)), memory O(1).

Probabilistic; needs a bounded interval.

Key difference: BSGS is deterministic and memory-heavy; Kangaroo is probabilistic, constant-memory, and interval-based.

MITM Algorithm:
Large and small circle reduce range constantly till solution not found. (not public available, get all free RAM/VRAM, tested only with known PK, so far, MITM has not been used to solve any truly complex puzzle, need powerful hardware)





Only with the key exposed—these two algorithms, correct?
Efim_Wr
Newbie
*
Offline

Activity: 10
Merit: 0


View Profile WWW
November 10, 2026, 01:44:33 PM
 #14064

Hello everyone,

I'd like to share an open-source tool I developed for visualizing and studying the Pollard's Kangaroo algorithm on the secp256k1 elliptic curve. This isn't just another "key cracking" script — it's an educational project designed to show exactly how the "Tame" and "Wild" kangaroos jump across the curve, converge, and eventually collide in real-time.
https://github.com/Fantom-C/web-pollard-kangaroo
Algorithm parameters: K (jump table size), dpBit (Distinguished Points filter to save memory), MAX_ITER, and jump direction (R/L). Auto-calculated optimal values are provided.
kTimesG
Sr. Member
****
Offline

Activity: 994
Merit: 277


View Profile
November 10, 2026, 01:59:26 PM
Merited by Cricktor (1)
 #14065

Pollard's Kangaroo (Lambda) Algorithm:
Solves g^x = h when x is known to lie in an interval [a,b].

Uses a tame kangaroo starting at g^b and a wild kangaroo starting at h.

The improved versions start from (a+b)/2 for obvious reasons. Oorschot's paper had a terrible typo about that "b" that contradicts the analysis just one page after. Most people later reproduced the typo, because academic papers need to confirm flaws. Waiting for the troll agents now.

Efim_Wr
Newbie
*
Offline

Activity: 10
Merit: 0


View Profile WWW
November 11, 2026, 09:39:25 AM
 #14066

I’m planning to release a tool with a graphical user interface for the SOTA and SOTA2 methods, featuring flexible settings for the "kangaroos" and their behavior, with GPU-accelerated processing. Do you think there’s a need for a tool like this?
cctv5go
Newbie
*
Offline

Activity: 65
Merit: 0


View Profile
November 12, 2026, 08:49:54 AM
 #14067

Code:
==========* FOUND!=========
[Launch 58] Total:93, 415, 538, 688 koys | Rate: 377.25 M keys/s | Elapsed: 4.3s

Code:
Device Name:                NVIDIA GeForce GTX 1650 Ti
FOUND VERIFIED SOLUTION:
PRIVATE KEY:      1,003,651,412,950
SEARCH TIME:      00:00:02
probes_done:      536870912 (0.0977% of sweep)
Roll Eyes
The scanning method is different, and so are the results. Bro, you did a good job.
Bitcoin71
Newbie
*
Offline

Activity: 6
Merit: 1


View Profile
November 12, 2026, 09:22:11 AM
 #14068

Did anyone considered converting that private keys to RAW micro timestamp? From the exact time of the transaction You might get something here!
brainless
Member
**
Offline

Activity: 510
Merit: 46


View Profile
November 17, 2026, 01:09:33 PM
 #14069

Who have ability to check 1 million pubkeys in 100 bit range, with kangaroo +database
And how much time it will take?

13sXkWqtivcMtNGQpskD78iqsgVy9hcHLF
bankeroft
Newbie
*
Offline

Activity: 26
Merit: 0


View Profile
November 17, 2026, 10:12:49 PM
 #14070

Who have ability to check 1 million pubkeys in 100 bit range, with kangaroo +database
And how much time it will take?

Using Kangaroo + existing databases to "scan" 1 million 100-bit public keys one by one is theoretically possible but practically infeasible, with time measured in thousands of years or more  Cheesy Shocked
Efim_Wr
Newbie
*
Offline

Activity: 10
Merit: 0


View Profile WWW
Today at 10:48:24 AM
 #14071

Who have ability to check 1 million pubkeys in 100 bit range, with kangaroo +database
And how much time it will take?
On a Tesla V100, searching for a single key within a given range takes about a day; consequently, searching for 1 million keys on the same graphics card would require 1 million days—though if the card proves to be faster, the result could be obtained sooner.
Pages: « 1 ... 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 [704]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!