Block #2,143,504

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/3/2017, 12:10:12 PM · Difficulty 10.8803 · 4,699,767 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d953bf014f56a596bf40326691c6fd78ebcf0fd9b28f781659e131f876774bd

Height

#2,143,504

Difficulty

10.880318

Transactions

2

Size

426 B

Version

2

Bits

0ae15c84

Nonce

1,390,967,361

Timestamp

6/3/2017, 12:10:12 PM

Confirmations

4,699,767

Merkle Root

4026c4484fc3aa821ccd8c662f36521c1beb9c37f346a82d5fba752c878f9ae7
Transactions (2)
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.256 × 10⁹⁵(96-digit number)
12568672149940688009…49786870445137207999
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.256 × 10⁹⁵(96-digit number)
12568672149940688009…49786870445137207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.513 × 10⁹⁵(96-digit number)
25137344299881376018…99573740890274415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.027 × 10⁹⁵(96-digit number)
50274688599762752036…99147481780548831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.005 × 10⁹⁶(97-digit number)
10054937719952550407…98294963561097663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.010 × 10⁹⁶(97-digit number)
20109875439905100814…96589927122195327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.021 × 10⁹⁶(97-digit number)
40219750879810201629…93179854244390655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.043 × 10⁹⁶(97-digit number)
80439501759620403258…86359708488781311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.608 × 10⁹⁷(98-digit number)
16087900351924080651…72719416977562623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.217 × 10⁹⁷(98-digit number)
32175800703848161303…45438833955125247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.435 × 10⁹⁷(98-digit number)
64351601407696322606…90877667910250495999
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,990,542 XPM·at block #6,843,270 · 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