Block #1,346,509

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2015, 10:41:06 PM · Difficulty 10.8224 · 5,463,128 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c4b170dcab7796dc033c47c66bbc88ddfdd19dcdff91a577d585646f9cecc304

Height

#1,346,509

Difficulty

10.822446

Transactions

3

Size

3.89 KB

Version

2

Bits

0ad28bcd

Nonce

76,738,647

Timestamp

11/28/2015, 10:41:06 PM

Confirmations

5,463,128

Merkle Root

a14006a48427da647b31964bd54296d83db4708ab9c2e6d79af11be0695b0ddd
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.

2.240 × 10⁹⁵(96-digit number)
22401435981581507017…82781420794819955841
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
2.240 × 10⁹⁵(96-digit number)
22401435981581507017…82781420794819955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.480 × 10⁹⁵(96-digit number)
44802871963163014034…65562841589639911681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.960 × 10⁹⁵(96-digit number)
89605743926326028069…31125683179279823361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.792 × 10⁹⁶(97-digit number)
17921148785265205613…62251366358559646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.584 × 10⁹⁶(97-digit number)
35842297570530411227…24502732717119293441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.168 × 10⁹⁶(97-digit number)
71684595141060822455…49005465434238586881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.433 × 10⁹⁷(98-digit number)
14336919028212164491…98010930868477173761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.867 × 10⁹⁷(98-digit number)
28673838056424328982…96021861736954347521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.734 × 10⁹⁷(98-digit number)
57347676112848657964…92043723473908695041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.146 × 10⁹⁸(99-digit number)
11469535222569731592…84087446947817390081
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,721,174 XPM·at block #6,809,636 · 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