Block #636,163

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/16/2014, 5:35:06 PM · Difficulty 10.9639 · 6,170,656 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b0473f30e88616391b40c4748fb01f1eade6d42d2609f9a089c4c5d3aa4bac12

Height

#636,163

Difficulty

10.963884

Transactions

1

Size

767 B

Version

2

Bits

0af6c11a

Nonce

216,728

Timestamp

7/16/2014, 5:35:06 PM

Confirmations

6,170,656

Merkle Root

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

7.478 × 10⁹⁹(100-digit number)
74782114202636778210…39177328958886646399
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
7.478 × 10⁹⁹(100-digit number)
74782114202636778210…39177328958886646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.495 × 10¹⁰⁰(101-digit number)
14956422840527355642…78354657917773292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.991 × 10¹⁰⁰(101-digit number)
29912845681054711284…56709315835546585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.982 × 10¹⁰⁰(101-digit number)
59825691362109422568…13418631671093171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.196 × 10¹⁰¹(102-digit number)
11965138272421884513…26837263342186342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.393 × 10¹⁰¹(102-digit number)
23930276544843769027…53674526684372684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.786 × 10¹⁰¹(102-digit number)
47860553089687538055…07349053368745369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.572 × 10¹⁰¹(102-digit number)
95721106179375076110…14698106737490739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.914 × 10¹⁰²(103-digit number)
19144221235875015222…29396213474981478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.828 × 10¹⁰²(103-digit number)
38288442471750030444…58792426949962956799
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,698,653 XPM·at block #6,806,818 · 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