Block #752,065

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/4/2014, 11:41:58 AM · Difficulty 10.9735 · 6,064,738 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a59b04f8a27ab102de69f9fbd3807726f3104ec6c755b9ed000ca6b73398b8d7

Height

#752,065

Difficulty

10.973495

Transactions

5

Size

1.66 KB

Version

2

Bits

0af936f5

Nonce

2,203,014,211

Timestamp

10/4/2014, 11:41:58 AM

Confirmations

6,064,738

Merkle Root

313700de855ba7b524c47ab67af71df9f6cb8c13880f52ec9061e0493d6b5981
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.184 × 10⁹⁸(99-digit number)
11849612632371625756…85223103959208468481
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.184 × 10⁹⁸(99-digit number)
11849612632371625756…85223103959208468481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.369 × 10⁹⁸(99-digit number)
23699225264743251512…70446207918416936961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.739 × 10⁹⁸(99-digit number)
47398450529486503025…40892415836833873921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.479 × 10⁹⁸(99-digit number)
94796901058973006051…81784831673667747841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.895 × 10⁹⁹(100-digit number)
18959380211794601210…63569663347335495681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.791 × 10⁹⁹(100-digit number)
37918760423589202420…27139326694670991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.583 × 10⁹⁹(100-digit number)
75837520847178404841…54278653389341982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.516 × 10¹⁰⁰(101-digit number)
15167504169435680968…08557306778683965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.033 × 10¹⁰⁰(101-digit number)
30335008338871361936…17114613557367930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.067 × 10¹⁰⁰(101-digit number)
60670016677742723873…34229227114735861761
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,778,460 XPM·at block #6,816,802 · 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