Block #2,802,435

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 5:20:18 PM · Difficulty 11.6708 · 4,039,732 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
99e7a3c4fe12b2a134c6f45417b9d35f8cbd472648bd7525c1473309cd274b68

Height

#2,802,435

Difficulty

11.670812

Transactions

8

Size

2.89 KB

Version

2

Bits

0babba55

Nonce

604,401,333

Timestamp

8/20/2018, 5:20:18 PM

Confirmations

4,039,732

Merkle Root

3a8dcb8498d52644fffef8f32ad2d30d51cb2973a4cf145ff0ab5b194e5a8916
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.657 × 10⁹³(94-digit number)
36577245469619013545…38298210372831989761
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.657 × 10⁹³(94-digit number)
36577245469619013545…38298210372831989761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.315 × 10⁹³(94-digit number)
73154490939238027091…76596420745663979521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.463 × 10⁹⁴(95-digit number)
14630898187847605418…53192841491327959041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.926 × 10⁹⁴(95-digit number)
29261796375695210836…06385682982655918081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.852 × 10⁹⁴(95-digit number)
58523592751390421673…12771365965311836161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.170 × 10⁹⁵(96-digit number)
11704718550278084334…25542731930623672321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.340 × 10⁹⁵(96-digit number)
23409437100556168669…51085463861247344641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.681 × 10⁹⁵(96-digit number)
46818874201112337338…02170927722494689281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.363 × 10⁹⁵(96-digit number)
93637748402224674677…04341855444989378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.872 × 10⁹⁶(97-digit number)
18727549680444934935…08683710889978757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.745 × 10⁹⁶(97-digit number)
37455099360889869870…17367421779957514241
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,981,727 XPM·at block #6,842,166 · 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