Block #636,262

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2014, 7:11:37 PM · Difficulty 10.9639 · 6,181,576 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9609e46889476cc384a33957a9871464ae89734933363bcf038a34198741252

Height

#636,262

Difficulty

10.963890

Transactions

9

Size

2.40 KB

Version

2

Bits

0af6c183

Nonce

1,572,198,253

Timestamp

7/16/2014, 7:11:37 PM

Confirmations

6,181,576

Merkle Root

fe94ca1afa4dfa6f29b869058d5c1fbf023adfb07dc2e19e43072486d0f2f1e9
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.896 × 10⁹⁷(98-digit number)
18961960103237458607…05685723812773888001
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.896 × 10⁹⁷(98-digit number)
18961960103237458607…05685723812773888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.792 × 10⁹⁷(98-digit number)
37923920206474917214…11371447625547776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.584 × 10⁹⁷(98-digit number)
75847840412949834429…22742895251095552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.516 × 10⁹⁸(99-digit number)
15169568082589966885…45485790502191104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.033 × 10⁹⁸(99-digit number)
30339136165179933771…90971581004382208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.067 × 10⁹⁸(99-digit number)
60678272330359867543…81943162008764416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.213 × 10⁹⁹(100-digit number)
12135654466071973508…63886324017528832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.427 × 10⁹⁹(100-digit number)
24271308932143947017…27772648035057664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.854 × 10⁹⁹(100-digit number)
48542617864287894034…55545296070115328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.708 × 10⁹⁹(100-digit number)
97085235728575788069…11090592140230656001
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,786,768 XPM·at block #6,817,837 · 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