Block #636,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/17/2014, 2:11:00 AM · Difficulty 10.9636 · 6,180,953 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
301cffab6c4fc9a484f41c8b7d6add3e2faa5addba7e2d631518158563c9c067

Height

#636,642

Difficulty

10.963623

Transactions

7

Size

1.82 KB

Version

2

Bits

0af6afff

Nonce

190,253,835

Timestamp

7/17/2014, 2:11:00 AM

Confirmations

6,180,953

Merkle Root

608695e26d842bd9ed5e7f949594bd6e1d5c039c72318412e4b1c963ed16ae3e
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.368 × 10⁹⁶(97-digit number)
13681214828613611156…79818630648350590401
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.368 × 10⁹⁶(97-digit number)
13681214828613611156…79818630648350590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.736 × 10⁹⁶(97-digit number)
27362429657227222312…59637261296701180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.472 × 10⁹⁶(97-digit number)
54724859314454444624…19274522593402361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.094 × 10⁹⁷(98-digit number)
10944971862890888924…38549045186804723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.188 × 10⁹⁷(98-digit number)
21889943725781777849…77098090373609446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.377 × 10⁹⁷(98-digit number)
43779887451563555699…54196180747218892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.755 × 10⁹⁷(98-digit number)
87559774903127111399…08392361494437785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.751 × 10⁹⁸(99-digit number)
17511954980625422279…16784722988875571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.502 × 10⁹⁸(99-digit number)
35023909961250844559…33569445977751142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.004 × 10⁹⁸(99-digit number)
70047819922501689119…67138891955502284801
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,784,813 XPM·at block #6,817,594 · 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