Block #636,250

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/16/2014, 7:03:06 PM · Difficulty 10.9639 · 6,178,565 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb3d3a431a5a49cc9387766b0f57987e44f723268e19f39d88dd7b3bc2c3592b

Height

#636,250

Difficulty

10.963874

Transactions

12

Size

3.35 KB

Version

2

Bits

0af6c06e

Nonce

408,067,087

Timestamp

7/16/2014, 7:03:06 PM

Confirmations

6,178,565

Merkle Root

78cc51d4bfb8b2902a0ce9e2235fb1d3620cb1392365ea094f5e1b79d0a1d78e
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.

2.770 × 10⁹⁴(95-digit number)
27700046881014735629…62878476010130405439
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
2.770 × 10⁹⁴(95-digit number)
27700046881014735629…62878476010130405439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.540 × 10⁹⁴(95-digit number)
55400093762029471259…25756952020260810879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.108 × 10⁹⁵(96-digit number)
11080018752405894251…51513904040521621759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.216 × 10⁹⁵(96-digit number)
22160037504811788503…03027808081043243519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.432 × 10⁹⁵(96-digit number)
44320075009623577007…06055616162086487039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.864 × 10⁹⁵(96-digit number)
88640150019247154015…12111232324172974079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.772 × 10⁹⁶(97-digit number)
17728030003849430803…24222464648345948159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.545 × 10⁹⁶(97-digit number)
35456060007698861606…48444929296691896319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.091 × 10⁹⁶(97-digit number)
70912120015397723212…96889858593383792639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.418 × 10⁹⁷(98-digit number)
14182424003079544642…93779717186767585279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.836 × 10⁹⁷(98-digit number)
28364848006159089284…87559434373535170559
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 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
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 1CC formula:

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