Block #2,224,940

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/27/2017, 7:36:49 AM · Difficulty 10.9474 · 4,600,083 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c6549d520395e42410ec92baa18b59e8398b9acc3592ac64f55f4be5f89a67cf

Height

#2,224,940

Difficulty

10.947358

Transactions

8

Size

2.51 KB

Version

2

Bits

0af28606

Nonce

783,206,580

Timestamp

7/27/2017, 7:36:49 AM

Confirmations

4,600,083

Merkle Root

84257e9a8e416314e81d067220b12aab2964a3cdb89639c3eeb27b3b3537f4a7
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.

3.365 × 10⁹⁴(95-digit number)
33657072521840624713…83849139584922557439
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
3.365 × 10⁹⁴(95-digit number)
33657072521840624713…83849139584922557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.731 × 10⁹⁴(95-digit number)
67314145043681249426…67698279169845114879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.346 × 10⁹⁵(96-digit number)
13462829008736249885…35396558339690229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.692 × 10⁹⁵(96-digit number)
26925658017472499770…70793116679380459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.385 × 10⁹⁵(96-digit number)
53851316034944999541…41586233358760919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.077 × 10⁹⁶(97-digit number)
10770263206988999908…83172466717521838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.154 × 10⁹⁶(97-digit number)
21540526413977999816…66344933435043676159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.308 × 10⁹⁶(97-digit number)
43081052827955999632…32689866870087352319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.616 × 10⁹⁶(97-digit number)
86162105655911999265…65379733740174704639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.723 × 10⁹⁷(98-digit number)
17232421131182399853…30759467480349409279
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,844,267 XPM·at block #6,825,022 · 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