Block #637,677

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/17/2014, 10:29:54 PM · Difficulty 10.9623 · 6,178,504 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f6117439b79108b9b85c7b161c1eeec44629b7736cfd475ae73ffbe2c2d76b9

Height

#637,677

Difficulty

10.962308

Transactions

4

Size

882 B

Version

2

Bits

0af659d4

Nonce

696,908,314

Timestamp

7/17/2014, 10:29:54 PM

Confirmations

6,178,504

Merkle Root

6ae109061726b442964de29966fbb3a9445713c10242826fd073b19abdbc2d05
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.

3.217 × 10⁹⁴(95-digit number)
32170232679787616376…87172969066949017759
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
3.217 × 10⁹⁴(95-digit number)
32170232679787616376…87172969066949017759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.434 × 10⁹⁴(95-digit number)
64340465359575232753…74345938133898035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.286 × 10⁹⁵(96-digit number)
12868093071915046550…48691876267796071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.573 × 10⁹⁵(96-digit number)
25736186143830093101…97383752535592142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.147 × 10⁹⁵(96-digit number)
51472372287660186202…94767505071184284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.029 × 10⁹⁶(97-digit number)
10294474457532037240…89535010142368568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.058 × 10⁹⁶(97-digit number)
20588948915064074481…79070020284737136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.117 × 10⁹⁶(97-digit number)
41177897830128148962…58140040569474273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.235 × 10⁹⁶(97-digit number)
82355795660256297924…16280081138948546559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.647 × 10⁹⁷(98-digit number)
16471159132051259584…32560162277897093119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.294 × 10⁹⁷(98-digit number)
32942318264102519169…65120324555794186239
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,773,573 XPM·at block #6,816,180 · 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