Block #673,722

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/11/2014, 6:35:18 PM · Difficulty 10.9653 · 6,136,516 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
56749b27eba3c72e16d48cdc99b3d21e7c63720dac4cc39d9e96b8ded856b2cd

Height

#673,722

Difficulty

10.965276

Transactions

4

Size

1.43 KB

Version

2

Bits

0af71c59

Nonce

53,978,076

Timestamp

8/11/2014, 6:35:18 PM

Confirmations

6,136,516

Merkle Root

0f3dcc782f0dc174ff6f7b00fc04e29f20fdf18feae8f9f30e4cc21c17feb43d
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.

3.524 × 10⁹³(94-digit number)
35242341673834707527…38957971017466655511
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
3.524 × 10⁹³(94-digit number)
35242341673834707527…38957971017466655511
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.048 × 10⁹³(94-digit number)
70484683347669415054…77915942034933311021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.409 × 10⁹⁴(95-digit number)
14096936669533883010…55831884069866622041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.819 × 10⁹⁴(95-digit number)
28193873339067766021…11663768139733244081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.638 × 10⁹⁴(95-digit number)
56387746678135532043…23327536279466488161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.127 × 10⁹⁵(96-digit number)
11277549335627106408…46655072558932976321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.255 × 10⁹⁵(96-digit number)
22555098671254212817…93310145117865952641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.511 × 10⁹⁵(96-digit number)
45110197342508425634…86620290235731905281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.022 × 10⁹⁵(96-digit number)
90220394685016851269…73240580471463810561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.804 × 10⁹⁶(97-digit number)
18044078937003370253…46481160942927621121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.608 × 10⁹⁶(97-digit number)
36088157874006740507…92962321885855242241
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,725,981 XPM·at block #6,810,237 · 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.

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