Block #632,387

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/14/2014, 4:23:51 AM · Difficulty 10.9630 · 6,184,533 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd500785c6c90f8be036e0b6a1da17121eb87ff8e06034487b8c44b6fcfaaaba

Height

#632,387

Difficulty

10.962989

Transactions

4

Size

1.15 KB

Version

2

Bits

0af68674

Nonce

361,943,004

Timestamp

7/14/2014, 4:23:51 AM

Confirmations

6,184,533

Merkle Root

fe503a1c3e80c72c58f631ce0808e71695e6f0c68fe93a7494c1cb1792cd8eb2
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.688 × 10⁹⁶(97-digit number)
16886246149385891820…42659287681675115519
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.688 × 10⁹⁶(97-digit number)
16886246149385891820…42659287681675115519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.377 × 10⁹⁶(97-digit number)
33772492298771783640…85318575363350231039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.754 × 10⁹⁶(97-digit number)
67544984597543567281…70637150726700462079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.350 × 10⁹⁷(98-digit number)
13508996919508713456…41274301453400924159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.701 × 10⁹⁷(98-digit number)
27017993839017426912…82548602906801848319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.403 × 10⁹⁷(98-digit number)
54035987678034853825…65097205813603696639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.080 × 10⁹⁸(99-digit number)
10807197535606970765…30194411627207393279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.161 × 10⁹⁸(99-digit number)
21614395071213941530…60388823254414786559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.322 × 10⁹⁸(99-digit number)
43228790142427883060…20777646508829573119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.645 × 10⁹⁸(99-digit number)
86457580284855766120…41555293017659146239
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,779,402 XPM·at block #6,816,919 · 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