Block #2,241,815

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2017, 2:06:14 AM · Difficulty 10.9471 · 4,600,099 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6d3e9622df0bf69e3b4158f11a795e63b0421161340692a686af4c8bc8bea048

Height

#2,241,815

Difficulty

10.947091

Transactions

2

Size

871 B

Version

2

Bits

0af27490

Nonce

704,392,874

Timestamp

8/8/2017, 2:06:14 AM

Confirmations

4,600,099

Merkle Root

82cd89be7123584ad099bfd1d285e14df339201168c12e8e8eed9d259745b38d
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.

1.639 × 10⁹⁵(96-digit number)
16390252301500061281…11948595502642092641
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.639 × 10⁹⁵(96-digit number)
16390252301500061281…11948595502642092641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.278 × 10⁹⁵(96-digit number)
32780504603000122562…23897191005284185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.556 × 10⁹⁵(96-digit number)
65561009206000245124…47794382010568370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.311 × 10⁹⁶(97-digit number)
13112201841200049024…95588764021136741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.622 × 10⁹⁶(97-digit number)
26224403682400098049…91177528042273482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.244 × 10⁹⁶(97-digit number)
52448807364800196099…82355056084546964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10489761472960039219…64710112169093928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.097 × 10⁹⁷(98-digit number)
20979522945920078439…29420224338187857921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.195 × 10⁹⁷(98-digit number)
41959045891840156879…58840448676375715841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.391 × 10⁹⁷(98-digit number)
83918091783680313759…17680897352751431681
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,979,687 XPM·at block #6,841,913 · 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