Block #507,607

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 8:33:31 PM · Difficulty 10.8166 · 6,319,622 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f79578b8da9708f03c5c4d580d6025c17be2ecbed5984408c1e97631d9e3513

Height

#507,607

Difficulty

10.816621

Transactions

4

Size

1.14 KB

Version

2

Bits

0ad10e17

Nonce

13,944

Timestamp

4/23/2014, 8:33:31 PM

Confirmations

6,319,622

Merkle Root

2760e72bb8e88d5bf440323f9072106f51c55ed86840e7b83fb873de4649de27
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.

3.285 × 10⁹⁷(98-digit number)
32859630655693155704…66476071554469236801
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
3.285 × 10⁹⁷(98-digit number)
32859630655693155704…66476071554469236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.571 × 10⁹⁷(98-digit number)
65719261311386311409…32952143108938473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.314 × 10⁹⁸(99-digit number)
13143852262277262281…65904286217876947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.628 × 10⁹⁸(99-digit number)
26287704524554524563…31808572435753894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.257 × 10⁹⁸(99-digit number)
52575409049109049127…63617144871507788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.051 × 10⁹⁹(100-digit number)
10515081809821809825…27234289743015577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.103 × 10⁹⁹(100-digit number)
21030163619643619651…54468579486031155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.206 × 10⁹⁹(100-digit number)
42060327239287239302…08937158972062310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.412 × 10⁹⁹(100-digit number)
84120654478574478604…17874317944124620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.682 × 10¹⁰⁰(101-digit number)
16824130895714895720…35748635888249241601
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,861,931 XPM·at block #6,827,228 · 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