Block #5,604,942

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2024, 5:41:22 PM · Difficulty 10.8913 · 1,236,723 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f9c5e67d3410c635d00847dea0fcc1e723909eb526cc773b4cdd19654d3b360c

Height

#5,604,942

Difficulty

10.891302

Transactions

2

Size

20.50 KB

Version

536870912

Bits

0ae42c64

Nonce

270,027,747

Timestamp

1/10/2024, 5:41:22 PM

Confirmations

1,236,723

Mined by

Merkle Root

30016fe5195fd0df776a61ef1ea00a7d72d0895483e0b33d7be23c2a4a62e16b
Transactions (2)
1 in → 1 out8.3120 XPM108 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.

2.667 × 10⁹⁴(95-digit number)
26671621768043268473…64849900468570978999
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.667 × 10⁹⁴(95-digit number)
26671621768043268473…64849900468570978999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.334 × 10⁹⁴(95-digit number)
53343243536086536946…29699800937141957999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.066 × 10⁹⁵(96-digit number)
10668648707217307389…59399601874283915999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.133 × 10⁹⁵(96-digit number)
21337297414434614778…18799203748567831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.267 × 10⁹⁵(96-digit number)
42674594828869229557…37598407497135663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.534 × 10⁹⁵(96-digit number)
85349189657738459114…75196814994271327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.706 × 10⁹⁶(97-digit number)
17069837931547691822…50393629988542655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.413 × 10⁹⁶(97-digit number)
34139675863095383645…00787259977085311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.827 × 10⁹⁶(97-digit number)
68279351726190767291…01574519954170623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.365 × 10⁹⁷(98-digit number)
13655870345238153458…03149039908341247999
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,977,709 XPM·at block #6,841,664 · 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