Block #739,766

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/25/2014, 1:03:23 AM · Difficulty 10.9792 · 6,075,282 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
216bf730d36885099a020b342864c457858ca5fc6cc658168672792594c2371c

Height

#739,766

Difficulty

10.979158

Transactions

3

Size

657 B

Version

2

Bits

0afaaa1a

Nonce

2,404,673,859

Timestamp

9/25/2014, 1:03:23 AM

Confirmations

6,075,282

Merkle Root

f70d7dc4ef5002404af2ff227fe4d99112ef97a954d98bcbd3ee6a19cff58cc2
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.060 × 10⁹⁵(96-digit number)
10606634204072085370…45989743070485730921
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
1.060 × 10⁹⁵(96-digit number)
10606634204072085370…45989743070485730921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.121 × 10⁹⁵(96-digit number)
21213268408144170741…91979486140971461841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.242 × 10⁹⁵(96-digit number)
42426536816288341482…83958972281942923681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.485 × 10⁹⁵(96-digit number)
84853073632576682964…67917944563885847361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.697 × 10⁹⁶(97-digit number)
16970614726515336592…35835889127771694721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.394 × 10⁹⁶(97-digit number)
33941229453030673185…71671778255543389441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.788 × 10⁹⁶(97-digit number)
67882458906061346371…43343556511086778881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.357 × 10⁹⁷(98-digit number)
13576491781212269274…86687113022173557761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.715 × 10⁹⁷(98-digit number)
27152983562424538548…73374226044347115521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.430 × 10⁹⁷(98-digit number)
54305967124849077097…46748452088694231041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.086 × 10⁹⁸(99-digit number)
10861193424969815419…93496904177388462081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,764,474 XPM·at block #6,815,047 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy