Block #2,634,010

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 5:30:10 PM · Difficulty 11.2180 · 4,199,934 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
260facaff4949b4e2e95cfc6803decb01f2c57527c14f885b581380eb96576b3

Height

#2,634,010

Difficulty

11.217999

Transactions

3

Size

902 B

Version

2

Bits

0b37cec0

Nonce

948,654,894

Timestamp

4/28/2018, 5:30:10 PM

Confirmations

4,199,934

Merkle Root

9f6868c20f25e66e5dfc7d11b72e4c49bb6d68627b3317bac9dd8e372d22b9d3
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.

5.333 × 10⁹⁵(96-digit number)
53339806302948853792…02073132224299915919
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
5.333 × 10⁹⁵(96-digit number)
53339806302948853792…02073132224299915919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.066 × 10⁹⁶(97-digit number)
10667961260589770758…04146264448599831839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.133 × 10⁹⁶(97-digit number)
21335922521179541517…08292528897199663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.267 × 10⁹⁶(97-digit number)
42671845042359083034…16585057794399327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.534 × 10⁹⁶(97-digit number)
85343690084718166068…33170115588798654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.706 × 10⁹⁷(98-digit number)
17068738016943633213…66340231177597309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.413 × 10⁹⁷(98-digit number)
34137476033887266427…32680462355194618879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.827 × 10⁹⁷(98-digit number)
68274952067774532854…65360924710389237759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.365 × 10⁹⁸(99-digit number)
13654990413554906570…30721849420778475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.730 × 10⁹⁸(99-digit number)
27309980827109813141…61443698841556951039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.461 × 10⁹⁸(99-digit number)
54619961654219626283…22887397683113902079
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,915,780 XPM·at block #6,833,943 · 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