Block #374,539

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 2:43:57 AM · Difficulty 10.4215 · 6,435,805 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d7eaea7728033dca3db076d759856fd3451d56ec0925e5144e9852d5aec70ac

Height

#374,539

Difficulty

10.421527

Transactions

9

Size

2.33 KB

Version

2

Bits

0a6be935

Nonce

38,929

Timestamp

1/25/2014, 2:43:57 AM

Confirmations

6,435,805

Merkle Root

0a177468f9b84bdab6e1665d1d9cfc33050a56280cc6fc00aacf407ddc70b0c8
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.867 × 10⁹⁸(99-digit number)
68676711029849147180…37190819957118684159
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.867 × 10⁹⁸(99-digit number)
68676711029849147180…37190819957118684159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.373 × 10⁹⁹(100-digit number)
13735342205969829436…74381639914237368319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.747 × 10⁹⁹(100-digit number)
27470684411939658872…48763279828474736639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.494 × 10⁹⁹(100-digit number)
54941368823879317744…97526559656949473279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.098 × 10¹⁰⁰(101-digit number)
10988273764775863548…95053119313898946559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.197 × 10¹⁰⁰(101-digit number)
21976547529551727097…90106238627797893119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.395 × 10¹⁰⁰(101-digit number)
43953095059103454195…80212477255595786239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.790 × 10¹⁰⁰(101-digit number)
87906190118206908390…60424954511191572479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.758 × 10¹⁰¹(102-digit number)
17581238023641381678…20849909022383144959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.516 × 10¹⁰¹(102-digit number)
35162476047282763356…41699818044766289919
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,726,834 XPM·at block #6,810,343 · 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