Block #1,533,162

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2016, 8:54:00 AM · Difficulty 10.6164 · 5,284,414 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e9798242b2c4fd6f958be57b86324e5b7159c6ee8013a6867faf8e95c5e04c9

Height

#1,533,162

Difficulty

10.616446

Transactions

2

Size

1.28 KB

Version

2

Bits

0a9dcf68

Nonce

129,221,420

Timestamp

4/9/2016, 8:54:00 AM

Confirmations

5,284,414

Merkle Root

1bdec2d497f5b9588eebf56f1c6e7b029a94c125c462846ea8a6f6e1769bc2f8
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.

2.791 × 10⁹⁵(96-digit number)
27916760820930581187…63027275160529726721
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.791 × 10⁹⁵(96-digit number)
27916760820930581187…63027275160529726721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.583 × 10⁹⁵(96-digit number)
55833521641861162374…26054550321059453441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.116 × 10⁹⁶(97-digit number)
11166704328372232474…52109100642118906881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.233 × 10⁹⁶(97-digit number)
22333408656744464949…04218201284237813761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.466 × 10⁹⁶(97-digit number)
44666817313488929899…08436402568475627521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.933 × 10⁹⁶(97-digit number)
89333634626977859799…16872805136951255041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.786 × 10⁹⁷(98-digit number)
17866726925395571959…33745610273902510081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.573 × 10⁹⁷(98-digit number)
35733453850791143919…67491220547805020161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.146 × 10⁹⁷(98-digit number)
71466907701582287839…34982441095610040321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.429 × 10⁹⁸(99-digit number)
14293381540316457567…69964882191220080641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.858 × 10⁹⁸(99-digit number)
28586763080632915135…39929764382440161281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,784,659 XPM·at block #6,817,575 · 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