Block #2,048,205

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/1/2017, 2:20:52 PM · Difficulty 10.6869 · 4,791,170 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
992a9eb264fd039a707171665ee9edf9d16390d3c259e05b55348d968db3ca3e

Height

#2,048,205

Difficulty

10.686912

Transactions

2

Size

573 B

Version

2

Bits

0aafd974

Nonce

298,457,033

Timestamp

4/1/2017, 2:20:52 PM

Confirmations

4,791,170

Merkle Root

49b36cb828beafe20827c355c97a41a1cc7e25266a2d327cce05a7ae288d239b
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.935 × 10⁹⁵(96-digit number)
19352899472903180537…55166840440157914239
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.935 × 10⁹⁵(96-digit number)
19352899472903180537…55166840440157914239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.870 × 10⁹⁵(96-digit number)
38705798945806361075…10333680880315828479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.741 × 10⁹⁵(96-digit number)
77411597891612722150…20667361760631656959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.548 × 10⁹⁶(97-digit number)
15482319578322544430…41334723521263313919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.096 × 10⁹⁶(97-digit number)
30964639156645088860…82669447042526627839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.192 × 10⁹⁶(97-digit number)
61929278313290177720…65338894085053255679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.238 × 10⁹⁷(98-digit number)
12385855662658035544…30677788170106511359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.477 × 10⁹⁷(98-digit number)
24771711325316071088…61355576340213022719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.954 × 10⁹⁷(98-digit number)
49543422650632142176…22711152680426045439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.908 × 10⁹⁷(98-digit number)
99086845301264284352…45422305360852090879
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,959,283 XPM·at block #6,839,374 · 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