Block #1,533,842

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2016, 7:59:36 PM · Difficulty 10.6162 · 5,282,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
447fd22eba3be5c0270702a2a69ca544e39b5009b9d2e565a2d6d787ec08b6ec

Height

#1,533,842

Difficulty

10.616202

Transactions

1

Size

203 B

Version

2

Bits

0a9dbf67

Nonce

12,605

Timestamp

4/9/2016, 7:59:36 PM

Confirmations

5,282,487

Merkle Root

6ffc68f38bcad7a9b7ef095fde2094f9841b32c36c3670526f8e9051a9aec79e
Transactions (1)
1 in → 1 out8.8600 XPM109 B
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.

4.961 × 10¹⁰³(104-digit number)
49617400312375139943…54912109066395771811
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
4.961 × 10¹⁰³(104-digit number)
49617400312375139943…54912109066395771811
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.923 × 10¹⁰³(104-digit number)
99234800624750279887…09824218132791543621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.984 × 10¹⁰⁴(105-digit number)
19846960124950055977…19648436265583087241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.969 × 10¹⁰⁴(105-digit number)
39693920249900111955…39296872531166174481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.938 × 10¹⁰⁴(105-digit number)
79387840499800223910…78593745062332348961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.587 × 10¹⁰⁵(106-digit number)
15877568099960044782…57187490124664697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.175 × 10¹⁰⁵(106-digit number)
31755136199920089564…14374980249329395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.351 × 10¹⁰⁵(106-digit number)
63510272399840179128…28749960498658791681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.270 × 10¹⁰⁶(107-digit number)
12702054479968035825…57499920997317583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.540 × 10¹⁰⁶(107-digit number)
25404108959936071651…14999841994635166721
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,774,753 XPM·at block #6,816,328 · 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