Block #1,066,263

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2015, 10:58:46 AM · Difficulty 10.7368 · 5,746,572 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e54a3ea6f8aafde4d574f1ece2870043eece6cda91efc0ae9e2e4f17336ab90c

Height

#1,066,263

Difficulty

10.736827

Transactions

4

Size

2.01 KB

Version

2

Bits

0abca0b9

Nonce

1,942,453,216

Timestamp

5/19/2015, 10:58:46 AM

Confirmations

5,746,572

Merkle Root

e1fba714ccca7c3ce964f836fecb361de781faaf74f58094255707015722c813
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.113 × 10⁹⁶(97-digit number)
21138106653610395074…63235838101362785281
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.113 × 10⁹⁶(97-digit number)
21138106653610395074…63235838101362785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.227 × 10⁹⁶(97-digit number)
42276213307220790149…26471676202725570561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.455 × 10⁹⁶(97-digit number)
84552426614441580299…52943352405451141121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.691 × 10⁹⁷(98-digit number)
16910485322888316059…05886704810902282241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.382 × 10⁹⁷(98-digit number)
33820970645776632119…11773409621804564481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.764 × 10⁹⁷(98-digit number)
67641941291553264239…23546819243609128961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.352 × 10⁹⁸(99-digit number)
13528388258310652847…47093638487218257921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.705 × 10⁹⁸(99-digit number)
27056776516621305695…94187276974436515841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.411 × 10⁹⁸(99-digit number)
54113553033242611391…88374553948873031681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.082 × 10⁹⁹(100-digit number)
10822710606648522278…76749107897746063361
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,746,725 XPM·at block #6,812,834 · 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