Block #637,581

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/17/2014, 8:40:26 PM · Difficulty 10.9624 · 6,169,601 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
514884e4c6466d1ecccadd4797db8447ce249d9883396ecbf57821a91981d463

Height

#637,581

Difficulty

10.962405

Transactions

9

Size

2.37 KB

Version

2

Bits

0af66032

Nonce

689,948,471

Timestamp

7/17/2014, 8:40:26 PM

Confirmations

6,169,601

Merkle Root

792748fe78e7e2cbc1f674598bf2590412ad0982a89d43174b78045f9a5f0057
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.985 × 10⁹⁶(97-digit number)
19858522172487634955…97428027773733292801
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.985 × 10⁹⁶(97-digit number)
19858522172487634955…97428027773733292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.971 × 10⁹⁶(97-digit number)
39717044344975269910…94856055547466585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.943 × 10⁹⁶(97-digit number)
79434088689950539821…89712111094933171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.588 × 10⁹⁷(98-digit number)
15886817737990107964…79424222189866342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.177 × 10⁹⁷(98-digit number)
31773635475980215928…58848444379732684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.354 × 10⁹⁷(98-digit number)
63547270951960431856…17696888759465369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.270 × 10⁹⁸(99-digit number)
12709454190392086371…35393777518930739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.541 × 10⁹⁸(99-digit number)
25418908380784172742…70787555037861478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.083 × 10⁹⁸(99-digit number)
50837816761568345485…41575110075722956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.016 × 10⁹⁹(100-digit number)
10167563352313669097…83150220151445913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.033 × 10⁹⁹(100-digit number)
20335126704627338194…66300440302891827201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,701,467 XPM·at block #6,807,181 · 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