Block #617,517

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2014, 3:56:09 AM · Difficulty 10.9456 · 6,189,183 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e394d7cdb17e236de781db3bb7cbd2eef29a7c7e7aae79ca4ccde0ed9730687

Height

#617,517

Difficulty

10.945629

Transactions

7

Size

3.66 KB

Version

2

Bits

0af214b7

Nonce

105,847,937

Timestamp

7/5/2014, 3:56:09 AM

Confirmations

6,189,183

Merkle Root

5cc982b0ff0602752669d13a7acc538910cf81ec2b0d1743a35b95093ea2b46c
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.536 × 10⁹⁷(98-digit number)
25366557094678449301…17466205266694307839
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.536 × 10⁹⁷(98-digit number)
25366557094678449301…17466205266694307839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.073 × 10⁹⁷(98-digit number)
50733114189356898603…34932410533388615679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.014 × 10⁹⁸(99-digit number)
10146622837871379720…69864821066777231359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.029 × 10⁹⁸(99-digit number)
20293245675742759441…39729642133554462719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.058 × 10⁹⁸(99-digit number)
40586491351485518883…79459284267108925439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.117 × 10⁹⁸(99-digit number)
81172982702971037766…58918568534217850879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.623 × 10⁹⁹(100-digit number)
16234596540594207553…17837137068435701759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.246 × 10⁹⁹(100-digit number)
32469193081188415106…35674274136871403519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.493 × 10⁹⁹(100-digit number)
64938386162376830212…71348548273742807039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.298 × 10¹⁰⁰(101-digit number)
12987677232475366042…42697096547485614079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.597 × 10¹⁰⁰(101-digit number)
25975354464950732085…85394193094971228159
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,697,696 XPM·at block #6,806,699 · 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