Block #615,677

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/4/2014, 4:03:52 AM · Difficulty 10.9410 · 6,208,972 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
219bd53430041152d725225b3b4d641825e00fa5d9f18fdb2f28b4f28ec72391

Height

#615,677

Difficulty

10.940998

Transactions

4

Size

1.30 KB

Version

2

Bits

0af0e544

Nonce

3,094,340,057

Timestamp

7/4/2014, 4:03:52 AM

Confirmations

6,208,972

Merkle Root

3e59826d8e8631b2d58deaf043b45cb509582bf9017a5cbf78003532dd1a1204
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.530 × 10⁹⁶(97-digit number)
25306720701191200229…65947460123396787199
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.530 × 10⁹⁶(97-digit number)
25306720701191200229…65947460123396787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.061 × 10⁹⁶(97-digit number)
50613441402382400458…31894920246793574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.012 × 10⁹⁷(98-digit number)
10122688280476480091…63789840493587148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.024 × 10⁹⁷(98-digit number)
20245376560952960183…27579680987174297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.049 × 10⁹⁷(98-digit number)
40490753121905920367…55159361974348595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.098 × 10⁹⁷(98-digit number)
80981506243811840734…10318723948697190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.619 × 10⁹⁸(99-digit number)
16196301248762368146…20637447897394380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.239 × 10⁹⁸(99-digit number)
32392602497524736293…41274895794788761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.478 × 10⁹⁸(99-digit number)
64785204995049472587…82549791589577523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.295 × 10⁹⁹(100-digit number)
12957040999009894517…65099583179155046399
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,841,257 XPM·at block #6,824,648 · 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