Block #2,171,666

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/22/2017, 5:54:36 AM · Difficulty 10.9061 · 4,670,120 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
41505299c5d1f37a7ea1b75683386b0237850c30d84c526c155392ad90f59fad

Height

#2,171,666

Difficulty

10.906118

Transactions

4

Size

1.00 KB

Version

2

Bits

0ae7f760

Nonce

249,671,552

Timestamp

6/22/2017, 5:54:36 AM

Confirmations

4,670,120

Merkle Root

c6286af4f614d3f256395e5ce34a856c3afd5cfb2a51e4d6f41908e62c591a1a
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.003 × 10⁹⁶(97-digit number)
10039303789564627262…44052143934583080961
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.003 × 10⁹⁶(97-digit number)
10039303789564627262…44052143934583080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.007 × 10⁹⁶(97-digit number)
20078607579129254524…88104287869166161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.015 × 10⁹⁶(97-digit number)
40157215158258509048…76208575738332323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.031 × 10⁹⁶(97-digit number)
80314430316517018097…52417151476664647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.606 × 10⁹⁷(98-digit number)
16062886063303403619…04834302953329295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.212 × 10⁹⁷(98-digit number)
32125772126606807239…09668605906658590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.425 × 10⁹⁷(98-digit number)
64251544253213614478…19337211813317181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.285 × 10⁹⁸(99-digit number)
12850308850642722895…38674423626634362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.570 × 10⁹⁸(99-digit number)
25700617701285445791…77348847253268725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.140 × 10⁹⁸(99-digit number)
51401235402570891582…54697694506537451521
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,978,666 XPM·at block #6,841,785 · 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