Block #617,371

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2014, 2:05:26 AM · Difficulty 10.9452 · 6,197,106 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
514be6b3fc54a2b86534757c5dbeee1ee384d61eba74f06cbd78fee268f04d47

Height

#617,371

Difficulty

10.945243

Transactions

2

Size

398 B

Version

2

Bits

0af1fb76

Nonce

892,203,061

Timestamp

7/5/2014, 2:05:26 AM

Confirmations

6,197,106

Merkle Root

803e86200a1b0cea25dd30be22f72e1ee61eaf0329e3fbd470b76b27d482d6cc
Transactions (2)
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.

6.460 × 10⁹⁷(98-digit number)
64605855312891770618…01428553103509961319
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
6.460 × 10⁹⁷(98-digit number)
64605855312891770618…01428553103509961319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.292 × 10⁹⁸(99-digit number)
12921171062578354123…02857106207019922639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.584 × 10⁹⁸(99-digit number)
25842342125156708247…05714212414039845279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.168 × 10⁹⁸(99-digit number)
51684684250313416494…11428424828079690559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.033 × 10⁹⁹(100-digit number)
10336936850062683298…22856849656159381119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.067 × 10⁹⁹(100-digit number)
20673873700125366597…45713699312318762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.134 × 10⁹⁹(100-digit number)
41347747400250733195…91427398624637524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.269 × 10⁹⁹(100-digit number)
82695494800501466391…82854797249275048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.653 × 10¹⁰⁰(101-digit number)
16539098960100293278…65709594498550097919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.307 × 10¹⁰⁰(101-digit number)
33078197920200586556…31419188997100195839
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,759,891 XPM·at block #6,814,476 · 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