Block #634,598

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/15/2014, 2:39:00 PM · Difficulty 10.9642 · 6,175,499 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0e08448246fb3e4603ede72e1a89319be3d9fc61800f4fb2f855aa08c376b19f

Height

#634,598

Difficulty

10.964161

Transactions

5

Size

1.38 KB

Version

2

Bits

0af6d33c

Nonce

1,204,728,104

Timestamp

7/15/2014, 2:39:00 PM

Confirmations

6,175,499

Merkle Root

8965d83e601a539a91bfcd37d8567d8eb60a8ae9553153a06a46678db8973360
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.360 × 10⁹⁸(99-digit number)
33600325608509052562…48553311968003747839
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.360 × 10⁹⁸(99-digit number)
33600325608509052562…48553311968003747839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.720 × 10⁹⁸(99-digit number)
67200651217018105124…97106623936007495679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.344 × 10⁹⁹(100-digit number)
13440130243403621024…94213247872014991359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.688 × 10⁹⁹(100-digit number)
26880260486807242049…88426495744029982719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.376 × 10⁹⁹(100-digit number)
53760520973614484099…76852991488059965439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.075 × 10¹⁰⁰(101-digit number)
10752104194722896819…53705982976119930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.150 × 10¹⁰⁰(101-digit number)
21504208389445793639…07411965952239861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.300 × 10¹⁰⁰(101-digit number)
43008416778891587279…14823931904479723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.601 × 10¹⁰⁰(101-digit number)
86016833557783174558…29647863808959447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.720 × 10¹⁰¹(102-digit number)
17203366711556634911…59295727617918894079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.440 × 10¹⁰¹(102-digit number)
34406733423113269823…18591455235837788159
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,724,851 XPM·at block #6,810,096 · 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