Block #2,169,821

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/21/2017, 3:47:56 AM · Difficulty 10.9007 · 4,670,263 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d24fc8be247bc95b4d67d9da435180b585742b54299c8d73223d258c398f19a2

Height

#2,169,821

Difficulty

10.900701

Transactions

2

Size

1.43 KB

Version

2

Bits

0ae69456

Nonce

133,670,119

Timestamp

6/21/2017, 3:47:56 AM

Confirmations

4,670,263

Merkle Root

921d7b655c42edfbe4e7ddfb7e21345e5339f8e7b5e37d0a3e75677dfe0239ea
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.

4.318 × 10⁹⁴(95-digit number)
43188877468500913323…39019968717528473601
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
4.318 × 10⁹⁴(95-digit number)
43188877468500913323…39019968717528473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.637 × 10⁹⁴(95-digit number)
86377754937001826646…78039937435056947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.727 × 10⁹⁵(96-digit number)
17275550987400365329…56079874870113894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.455 × 10⁹⁵(96-digit number)
34551101974800730658…12159749740227788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.910 × 10⁹⁵(96-digit number)
69102203949601461317…24319499480455577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.382 × 10⁹⁶(97-digit number)
13820440789920292263…48638998960911155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.764 × 10⁹⁶(97-digit number)
27640881579840584526…97277997921822310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.528 × 10⁹⁶(97-digit number)
55281763159681169053…94555995843644620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.105 × 10⁹⁷(98-digit number)
11056352631936233810…89111991687289241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.211 × 10⁹⁷(98-digit number)
22112705263872467621…78223983374578483201
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,964,981 XPM·at block #6,840,083 · 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