Block #3,558,369

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2020, 6:40:05 AM · Difficulty 10.9126 · 3,259,551 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
73657ce968ef763f845aa8899855fa5b6b5e1349e5c905682418e9a9fca23718

Height

#3,558,369

Difficulty

10.912581

Transactions

2

Size

20.96 KB

Version

2

Bits

0ae99eeb

Nonce

742,003,136

Timestamp

2/15/2020, 6:40:05 AM

Confirmations

3,259,551

Merkle Root

c13266813dfcb32b4e056a8bb0811e3e56301a515e7b6b512ef9aeda55fae5ff
Transactions (2)
1 in → 1 out9.1300 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.

6.603 × 10⁹⁴(95-digit number)
66038594817518098011…39118211359486924799
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.603 × 10⁹⁴(95-digit number)
66038594817518098011…39118211359486924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.320 × 10⁹⁵(96-digit number)
13207718963503619602…78236422718973849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.641 × 10⁹⁵(96-digit number)
26415437927007239204…56472845437947699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.283 × 10⁹⁵(96-digit number)
52830875854014478408…12945690875895398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.056 × 10⁹⁶(97-digit number)
10566175170802895681…25891381751790796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.113 × 10⁹⁶(97-digit number)
21132350341605791363…51782763503581593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.226 × 10⁹⁶(97-digit number)
42264700683211582727…03565527007163187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.452 × 10⁹⁶(97-digit number)
84529401366423165454…07131054014326374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.690 × 10⁹⁷(98-digit number)
16905880273284633090…14262108028652748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.381 × 10⁹⁷(98-digit number)
33811760546569266181…28524216057305497599
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,787,425 XPM·at block #6,817,919 · 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