Block #653,293

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/29/2014, 11:00:40 AM · Difficulty 10.9548 · 6,171,737 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
865dc0cbedddbc20a156ef20bcfd952cab1d5301a488d47e3b3aec357c2c3e3d

Height

#653,293

Difficulty

10.954823

Transactions

4

Size

1.15 KB

Version

2

Bits

0af46f45

Nonce

68,935,100

Timestamp

7/29/2014, 11:00:40 AM

Confirmations

6,171,737

Merkle Root

350209983ec2b9aff1f09ab92fdbfb98d9ab2f40915adeca59d0b66e00299b29
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.

1.180 × 10⁹⁸(99-digit number)
11801627655330026270…11981239753244769279
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
1.180 × 10⁹⁸(99-digit number)
11801627655330026270…11981239753244769279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.360 × 10⁹⁸(99-digit number)
23603255310660052540…23962479506489538559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.720 × 10⁹⁸(99-digit number)
47206510621320105080…47924959012979077119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.441 × 10⁹⁸(99-digit number)
94413021242640210160…95849918025958154239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.888 × 10⁹⁹(100-digit number)
18882604248528042032…91699836051916308479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.776 × 10⁹⁹(100-digit number)
37765208497056084064…83399672103832616959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.553 × 10⁹⁹(100-digit number)
75530416994112168128…66799344207665233919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.510 × 10¹⁰⁰(101-digit number)
15106083398822433625…33598688415330467839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.021 × 10¹⁰⁰(101-digit number)
30212166797644867251…67197376830660935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.042 × 10¹⁰⁰(101-digit number)
60424333595289734502…34394753661321871359
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,844,323 XPM·at block #6,825,029 · 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