Block #185,568

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/29/2013, 9:41:44 AM · Difficulty 9.8623 · 6,625,592 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9047a89907e599b30e1338d32bc31506af1a4d662e9fd00dd036bfa133576e7b

Height

#185,568

Difficulty

9.862302

Transactions

6

Size

3.90 KB

Version

2

Bits

09dcbfd8

Nonce

53,529

Timestamp

9/29/2013, 9:41:44 AM

Confirmations

6,625,592

Merkle Root

be9360687afc94829dc7495bbb834674c2d42a9aa2365ce3eb9d4b6d81c7adcd
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.615 × 10⁹⁸(99-digit number)
66157849874445207099…59489674393483233279
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.615 × 10⁹⁸(99-digit number)
66157849874445207099…59489674393483233279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.323 × 10⁹⁹(100-digit number)
13231569974889041419…18979348786966466559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.646 × 10⁹⁹(100-digit number)
26463139949778082839…37958697573932933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.292 × 10⁹⁹(100-digit number)
52926279899556165679…75917395147865866239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.058 × 10¹⁰⁰(101-digit number)
10585255979911233135…51834790295731732479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.117 × 10¹⁰⁰(101-digit number)
21170511959822466271…03669580591463464959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.234 × 10¹⁰⁰(101-digit number)
42341023919644932543…07339161182926929919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.468 × 10¹⁰⁰(101-digit number)
84682047839289865087…14678322365853859839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.693 × 10¹⁰¹(102-digit number)
16936409567857973017…29356644731707719679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.387 × 10¹⁰¹(102-digit number)
33872819135715946035…58713289463415439359
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,733,392 XPM·at block #6,811,159 · 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