Block #2,279,443

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2017, 3:52:49 PM · Difficulty 10.9559 · 4,551,642 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
36ea55df5e670f2991d403152c49b684d276b397b60a3f8d6de531e039a75227

Height

#2,279,443

Difficulty

10.955921

Transactions

58

Size

16.34 KB

Version

2

Bits

0af4b739

Nonce

636,348,886

Timestamp

9/2/2017, 3:52:49 PM

Confirmations

4,551,642

Merkle Root

f76ef61b73f9a250587f22a28b36b50450fa5d6a8b9f7d999a870157f4d8a3cb
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.910 × 10⁹⁴(95-digit number)
19108281413528447870…99234645716278748401
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.910 × 10⁹⁴(95-digit number)
19108281413528447870…99234645716278748401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.821 × 10⁹⁴(95-digit number)
38216562827056895741…98469291432557496801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.643 × 10⁹⁴(95-digit number)
76433125654113791483…96938582865114993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.528 × 10⁹⁵(96-digit number)
15286625130822758296…93877165730229987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.057 × 10⁹⁵(96-digit number)
30573250261645516593…87754331460459974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.114 × 10⁹⁵(96-digit number)
61146500523291033186…75508662920919948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.222 × 10⁹⁶(97-digit number)
12229300104658206637…51017325841839897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.445 × 10⁹⁶(97-digit number)
24458600209316413274…02034651683679795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.891 × 10⁹⁶(97-digit number)
48917200418632826549…04069303367359590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.783 × 10⁹⁶(97-digit number)
97834400837265653098…08138606734719180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.956 × 10⁹⁷(98-digit number)
19566880167453130619…16277213469438361601
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,892,820 XPM·at block #6,831,084 · 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