Block #530,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2014, 10:05:37 PM · Difficulty 10.8923 · 6,277,527 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cf1760911cb03454a1a85805c139217c0129df7d8038f8831fa3ee50839930d7

Height

#530,502

Difficulty

10.892300

Transactions

9

Size

2.44 KB

Version

2

Bits

0ae46dc0

Nonce

32,526,103

Timestamp

5/7/2014, 10:05:37 PM

Confirmations

6,277,527

Merkle Root

3c8220a512cd64c320982eab6214d5bb8fc62a87df03ae25a904c16fc90e623f
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.060 × 10⁹⁸(99-digit number)
20605753801861818020…58538071758980220501
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.060 × 10⁹⁸(99-digit number)
20605753801861818020…58538071758980220501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.121 × 10⁹⁸(99-digit number)
41211507603723636041…17076143517960441001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.242 × 10⁹⁸(99-digit number)
82423015207447272083…34152287035920882001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.648 × 10⁹⁹(100-digit number)
16484603041489454416…68304574071841764001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.296 × 10⁹⁹(100-digit number)
32969206082978908833…36609148143683528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.593 × 10⁹⁹(100-digit number)
65938412165957817667…73218296287367056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.318 × 10¹⁰⁰(101-digit number)
13187682433191563533…46436592574734112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.637 × 10¹⁰⁰(101-digit number)
26375364866383127066…92873185149468224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.275 × 10¹⁰⁰(101-digit number)
52750729732766254133…85746370298936448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.055 × 10¹⁰¹(102-digit number)
10550145946553250826…71492740597872896001
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,708,276 XPM·at block #6,808,028 · 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