Block #1,510,145

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2016, 8:54:28 AM · Difficulty 10.6167 · 5,334,255 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1835e25c719fa7728c459ef1322fff402a7eb0735ddb47eca2b320eb91905e97

Height

#1,510,145

Difficulty

10.616687

Transactions

16

Size

5.93 KB

Version

2

Bits

0a9ddf33

Nonce

193,152,037

Timestamp

3/24/2016, 8:54:28 AM

Confirmations

5,334,255

Merkle Root

1747cdcf17ac6f656b09035316dc7b5e8104386250933a3eafbd97808833a4a8
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.460 × 10⁹⁶(97-digit number)
94602822483396489470…18686952141722869761
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.460 × 10⁹⁶(97-digit number)
94602822483396489470…18686952141722869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.892 × 10⁹⁷(98-digit number)
18920564496679297894…37373904283445739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.784 × 10⁹⁷(98-digit number)
37841128993358595788…74747808566891479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.568 × 10⁹⁷(98-digit number)
75682257986717191576…49495617133782958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.513 × 10⁹⁸(99-digit number)
15136451597343438315…98991234267565916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.027 × 10⁹⁸(99-digit number)
30272903194686876630…97982468535131832321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.054 × 10⁹⁸(99-digit number)
60545806389373753260…95964937070263664641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.210 × 10⁹⁹(100-digit number)
12109161277874750652…91929874140527329281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.421 × 10⁹⁹(100-digit number)
24218322555749501304…83859748281054658561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.843 × 10⁹⁹(100-digit number)
48436645111499002608…67719496562109317121
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,999,592 XPM·at block #6,844,399 · 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