Block #2,170,022

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/21/2017, 6:46:29 AM · Difficulty 10.9012 · 4,672,948 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f6e4074aa663cb9b61adb16eba07e69fa337454cf250d13010baf9bb8ee9af92

Height

#2,170,022

Difficulty

10.901160

Transactions

2

Size

871 B

Version

2

Bits

0ae6b265

Nonce

698,825,215

Timestamp

6/21/2017, 6:46:29 AM

Confirmations

4,672,948

Merkle Root

fe71d370c925eab59b86898518be95b63acbc35f2bffd32e54446d32c804af7a
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.

8.710 × 10⁹³(94-digit number)
87107076060867173128…14214893877808319369
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
8.710 × 10⁹³(94-digit number)
87107076060867173128…14214893877808319369
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.742 × 10⁹⁴(95-digit number)
17421415212173434625…28429787755616638739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.484 × 10⁹⁴(95-digit number)
34842830424346869251…56859575511233277479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.968 × 10⁹⁴(95-digit number)
69685660848693738503…13719151022466554959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.393 × 10⁹⁵(96-digit number)
13937132169738747700…27438302044933109919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.787 × 10⁹⁵(96-digit number)
27874264339477495401…54876604089866219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.574 × 10⁹⁵(96-digit number)
55748528678954990802…09753208179732439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.114 × 10⁹⁶(97-digit number)
11149705735790998160…19506416359464879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.229 × 10⁹⁶(97-digit number)
22299411471581996320…39012832718929758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.459 × 10⁹⁶(97-digit number)
44598822943163992641…78025665437859517439
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,988,112 XPM·at block #6,842,969 · 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