Block #504,204

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/21/2014, 3:29:42 PM · Difficulty 10.8081 · 6,311,786 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a23ac1dad7b70a2f68af6bbebd06e54bfb06e56277c422f65647a78635243d73

Height

#504,204

Difficulty

10.808054

Transactions

8

Size

4.17 KB

Version

2

Bits

0acedca6

Nonce

158,421,381

Timestamp

4/21/2014, 3:29:42 PM

Confirmations

6,311,786

Merkle Root

f9a8d2977bf248b8a80951e938b0a0918c016d9107c51b33e2cf86a0dacae60c
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.

1.145 × 10⁹⁸(99-digit number)
11450711530260090018…19317379678995807041
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
1.145 × 10⁹⁸(99-digit number)
11450711530260090018…19317379678995807041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.290 × 10⁹⁸(99-digit number)
22901423060520180037…38634759357991614081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.580 × 10⁹⁸(99-digit number)
45802846121040360074…77269518715983228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.160 × 10⁹⁸(99-digit number)
91605692242080720148…54539037431966456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.832 × 10⁹⁹(100-digit number)
18321138448416144029…09078074863932912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.664 × 10⁹⁹(100-digit number)
36642276896832288059…18156149727865825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.328 × 10⁹⁹(100-digit number)
73284553793664576118…36312299455731650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.465 × 10¹⁰⁰(101-digit number)
14656910758732915223…72624598911463301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.931 × 10¹⁰⁰(101-digit number)
29313821517465830447…45249197822926602241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.862 × 10¹⁰⁰(101-digit number)
58627643034931660894…90498395645853204481
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,772,034 XPM·at block #6,815,989 · 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