Block #2,030,324

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2017, 1:43:32 AM · Difficulty 10.6947 · 4,811,538 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e81d975ea291f3ac1a954bb89add3e0e29de411348eb272ad3f102c4769b7f0

Height

#2,030,324

Difficulty

10.694666

Transactions

2

Size

2.01 KB

Version

2

Bits

0ab1d5a4

Nonce

1,725,167,026

Timestamp

3/20/2017, 1:43:32 AM

Confirmations

4,811,538

Merkle Root

34586b95eb44826499576d65907b4ef8dc53764400a5bb91d5a3e04996b880d4
Transactions (2)
1 in → 1 out8.7600 XPM109 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.

1.086 × 10⁹⁵(96-digit number)
10861531412722093427…87755868817803071999
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
1.086 × 10⁹⁵(96-digit number)
10861531412722093427…87755868817803071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.172 × 10⁹⁵(96-digit number)
21723062825444186855…75511737635606143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.344 × 10⁹⁵(96-digit number)
43446125650888373711…51023475271212287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.689 × 10⁹⁵(96-digit number)
86892251301776747422…02046950542424575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.737 × 10⁹⁶(97-digit number)
17378450260355349484…04093901084849151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.475 × 10⁹⁶(97-digit number)
34756900520710698968…08187802169698303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.951 × 10⁹⁶(97-digit number)
69513801041421397937…16375604339396607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.390 × 10⁹⁷(98-digit number)
13902760208284279587…32751208678793215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.780 × 10⁹⁷(98-digit number)
27805520416568559175…65502417357586431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.561 × 10⁹⁷(98-digit number)
55611040833137118350…31004834715172863999
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,979,273 XPM·at block #6,841,861 · 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