Block #618,479

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2014, 8:25:47 PM · Difficulty 10.9454 · 6,199,128 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e7a7c73e0e96883d468e0cc349da402e737f53b6c94dc03ae5e16846d0c1291

Height

#618,479

Difficulty

10.945381

Transactions

17

Size

4.32 KB

Version

2

Bits

0af2047b

Nonce

299,565,180

Timestamp

7/5/2014, 8:25:47 PM

Confirmations

6,199,128

Merkle Root

173d9b1b1bac8c03025300148abce85cecfe3a582864ab05d6fc63c1f0dea964
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.861 × 10⁹⁸(99-digit number)
38617509775861263409…36209403926249975679
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.861 × 10⁹⁸(99-digit number)
38617509775861263409…36209403926249975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.723 × 10⁹⁸(99-digit number)
77235019551722526819…72418807852499951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.544 × 10⁹⁹(100-digit number)
15447003910344505363…44837615704999902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.089 × 10⁹⁹(100-digit number)
30894007820689010727…89675231409999805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.178 × 10⁹⁹(100-digit number)
61788015641378021455…79350462819999610879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.235 × 10¹⁰⁰(101-digit number)
12357603128275604291…58700925639999221759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.471 × 10¹⁰⁰(101-digit number)
24715206256551208582…17401851279998443519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.943 × 10¹⁰⁰(101-digit number)
49430412513102417164…34803702559996887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.886 × 10¹⁰⁰(101-digit number)
98860825026204834329…69607405119993774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.977 × 10¹⁰¹(102-digit number)
19772165005240966865…39214810239987548159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.954 × 10¹⁰¹(102-digit number)
39544330010481933731…78429620479975096319
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,784,911 XPM·at block #6,817,606 · 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