Block #2,213,776

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/19/2017, 6:30:53 PM · Difficulty 10.9438 · 4,631,067 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d56599dee53163966cfda5c238a4e615516d05b14b23fce0cae9d5f6d8e435cd

Height

#2,213,776

Difficulty

10.943796

Transactions

5

Size

1.22 KB

Version

2

Bits

0af19ca5

Nonce

216,161,846

Timestamp

7/19/2017, 6:30:53 PM

Confirmations

4,631,067

Merkle Root

3404181cb10498bedeb22dfe47d619f9edb6dbf6e025e57ef5c767c870aeaef6
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.

9.318 × 10⁹²(93-digit number)
93188204634109949148…05032619586583531799
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
9.318 × 10⁹²(93-digit number)
93188204634109949148…05032619586583531799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.863 × 10⁹³(94-digit number)
18637640926821989829…10065239173167063599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.727 × 10⁹³(94-digit number)
37275281853643979659…20130478346334127199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.455 × 10⁹³(94-digit number)
74550563707287959318…40260956692668254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.491 × 10⁹⁴(95-digit number)
14910112741457591863…80521913385336508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.982 × 10⁹⁴(95-digit number)
29820225482915183727…61043826770673017599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.964 × 10⁹⁴(95-digit number)
59640450965830367454…22087653541346035199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.192 × 10⁹⁵(96-digit number)
11928090193166073490…44175307082692070399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.385 × 10⁹⁵(96-digit number)
23856180386332146981…88350614165384140799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.771 × 10⁹⁵(96-digit number)
47712360772664293963…76701228330768281599
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:58,003,153 XPM·at block #6,844,842 · 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