Block #1,510,073

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2016, 7:48:10 AM · Difficulty 10.6162 · 5,331,049 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cce273068eeff22882a80a8f0f5fa69ad7ee72734323ff148226aa57fb460688

Height

#1,510,073

Difficulty

10.616169

Transactions

23

Size

7.05 KB

Version

2

Bits

0a9dbd47

Nonce

682,636,089

Timestamp

3/24/2016, 7:48:10 AM

Confirmations

5,331,049

Merkle Root

13255bd12454dd44b31083e6862ed89b326e0ea79ba839c4c6a4543fe7d26315
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.638 × 10⁹⁷(98-digit number)
16386075040454608414…33624178049956044801
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.638 × 10⁹⁷(98-digit number)
16386075040454608414…33624178049956044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.277 × 10⁹⁷(98-digit number)
32772150080909216829…67248356099912089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.554 × 10⁹⁷(98-digit number)
65544300161818433658…34496712199824179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.310 × 10⁹⁸(99-digit number)
13108860032363686731…68993424399648358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.621 × 10⁹⁸(99-digit number)
26217720064727373463…37986848799296716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.243 × 10⁹⁸(99-digit number)
52435440129454746927…75973697598593433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.048 × 10⁹⁹(100-digit number)
10487088025890949385…51947395197186867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.097 × 10⁹⁹(100-digit number)
20974176051781898770…03894790394373734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.194 × 10⁹⁹(100-digit number)
41948352103563797541…07789580788747468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.389 × 10⁹⁹(100-digit number)
83896704207127595083…15579161577494937601
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,973,345 XPM·at block #6,841,121 · 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