Block #3,450,233

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/26/2019, 8:34:20 PM · Difficulty 10.9792 · 3,391,160 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dac4857aba84c429c7f728bea4eb0aaff777cf11a825da728fc113846171601f

Height

#3,450,233

Difficulty

10.979154

Transactions

2

Size

4.89 KB

Version

2

Bits

0afaa9d0

Nonce

562,282,808

Timestamp

11/26/2019, 8:34:20 PM

Confirmations

3,391,160

Merkle Root

f9cbde494b90157cf9a59683fd00e0ad634195a5125d365c73bd7d3f241e4836
Transactions (2)
1 in → 1 out8.3400 XPM110 B
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.

4.226 × 10⁹⁵(96-digit number)
42263374263029316323…93601200424439477599
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
4.226 × 10⁹⁵(96-digit number)
42263374263029316323…93601200424439477599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.452 × 10⁹⁵(96-digit number)
84526748526058632647…87202400848878955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.690 × 10⁹⁶(97-digit number)
16905349705211726529…74404801697757910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.381 × 10⁹⁶(97-digit number)
33810699410423453059…48809603395515820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.762 × 10⁹⁶(97-digit number)
67621398820846906118…97619206791031641599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.352 × 10⁹⁷(98-digit number)
13524279764169381223…95238413582063283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.704 × 10⁹⁷(98-digit number)
27048559528338762447…90476827164126566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.409 × 10⁹⁷(98-digit number)
54097119056677524894…80953654328253132799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.081 × 10⁹⁸(99-digit number)
10819423811335504978…61907308656506265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.163 × 10⁹⁸(99-digit number)
21638847622671009957…23814617313012531199
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,975,516 XPM·at block #6,841,392 · 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