Block #503,022

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 7:30:58 PM · Difficulty 10.8086 · 6,314,608 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a99a163f725e9afd3addf9b30b6a88ef273ffb96b658c668beb6d7c07ab945bb

Height

#503,022

Difficulty

10.808591

Transactions

1

Size

698 B

Version

2

Bits

0aceffd4

Nonce

178,295,851

Timestamp

4/20/2014, 7:30:58 PM

Confirmations

6,314,608

Merkle Root

2c6c54662983641685531b3fbc53ced40a5f44ea23d43d3131043baa9dcb053b
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.

8.195 × 10⁹⁷(98-digit number)
81952810067843778876…65816353279069171201
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
8.195 × 10⁹⁷(98-digit number)
81952810067843778876…65816353279069171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.639 × 10⁹⁸(99-digit number)
16390562013568755775…31632706558138342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.278 × 10⁹⁸(99-digit number)
32781124027137511550…63265413116276684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.556 × 10⁹⁸(99-digit number)
65562248054275023101…26530826232553369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.311 × 10⁹⁹(100-digit number)
13112449610855004620…53061652465106739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.622 × 10⁹⁹(100-digit number)
26224899221710009240…06123304930213478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.244 × 10⁹⁹(100-digit number)
52449798443420018481…12246609860426956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.048 × 10¹⁰⁰(101-digit number)
10489959688684003696…24493219720853913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.097 × 10¹⁰⁰(101-digit number)
20979919377368007392…48986439441707827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.195 × 10¹⁰⁰(101-digit number)
41959838754736014784…97972878883415654401
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,785,092 XPM·at block #6,817,629 · 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