Block #2,073,389

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2017, 6:04:25 PM · Difficulty 10.8405 · 4,760,525 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9f1a489effe36a3993aed5b2ebaa1f27219742360283f3661f2760a5ee87479b

Height

#2,073,389

Difficulty

10.840491

Transactions

31

Size

10.66 KB

Version

2

Bits

0ad72a68

Nonce

1,863,705,334

Timestamp

4/16/2017, 6:04:25 PM

Confirmations

4,760,525

Merkle Root

e153e3f3658e68a044a4b8dc66c9f5b26e53f27a2467ba53e5468b80257fa8e8
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.054 × 10⁹⁶(97-digit number)
60547254877958902491…78690397571394867199
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.054 × 10⁹⁶(97-digit number)
60547254877958902491…78690397571394867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.210 × 10⁹⁷(98-digit number)
12109450975591780498…57380795142789734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.421 × 10⁹⁷(98-digit number)
24218901951183560996…14761590285579468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.843 × 10⁹⁷(98-digit number)
48437803902367121993…29523180571158937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.687 × 10⁹⁷(98-digit number)
96875607804734243986…59046361142317875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.937 × 10⁹⁸(99-digit number)
19375121560946848797…18092722284635750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.875 × 10⁹⁸(99-digit number)
38750243121893697594…36185444569271500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.750 × 10⁹⁸(99-digit number)
77500486243787395189…72370889138543001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.550 × 10⁹⁹(100-digit number)
15500097248757479037…44741778277086003199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.100 × 10⁹⁹(100-digit number)
31000194497514958075…89483556554172006399
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,915,538 XPM·at block #6,833,913 · 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