Block #2,136,799

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2017, 12:03:10 PM · Difficulty 10.8915 · 4,690,040 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f9e03521413965a7c5ff6929e765b2b6dfab9e3bdfeedc5ef7cf1c2a2afdbec

Height

#2,136,799

Difficulty

10.891543

Transactions

2

Size

1.86 KB

Version

2

Bits

0ae43c22

Nonce

343,675,856

Timestamp

5/29/2017, 12:03:10 PM

Confirmations

4,690,040

Merkle Root

ed115c0a7c409a37c55dcb8c0c0edf6d8345780dac0013e62110aa59e09bfeff
Transactions (2)
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.

9.879 × 10⁹³(94-digit number)
98790993087874766847…85531237723515897921
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
9.879 × 10⁹³(94-digit number)
98790993087874766847…85531237723515897921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.975 × 10⁹⁴(95-digit number)
19758198617574953369…71062475447031795841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.951 × 10⁹⁴(95-digit number)
39516397235149906738…42124950894063591681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.903 × 10⁹⁴(95-digit number)
79032794470299813477…84249901788127183361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.580 × 10⁹⁵(96-digit number)
15806558894059962695…68499803576254366721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.161 × 10⁹⁵(96-digit number)
31613117788119925391…36999607152508733441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.322 × 10⁹⁵(96-digit number)
63226235576239850782…73999214305017466881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.264 × 10⁹⁶(97-digit number)
12645247115247970156…47998428610034933761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.529 × 10⁹⁶(97-digit number)
25290494230495940312…95996857220069867521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.058 × 10⁹⁶(97-digit number)
50580988460991880625…91993714440139735041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.011 × 10⁹⁷(98-digit number)
10116197692198376125…83987428880279470081
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,858,879 XPM·at block #6,826,838 · 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