Block #2,113,652

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2017, 3:19:42 AM · Difficulty 10.8993 · 4,722,701 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
368365294df43e52c402471bb73e63fd5f8bde27ece8742eaa0efadf21450bd5

Height

#2,113,652

Difficulty

10.899272

Transactions

2

Size

6.05 KB

Version

2

Bits

0ae636b7

Nonce

95,650,506

Timestamp

5/13/2017, 3:19:42 AM

Confirmations

4,722,701

Merkle Root

3d883f16c0a47ea790fdb44fbf275b01c4ce3d057bb7cfd6f82fdbf029a02070
Transactions (2)
1 in → 1 out8.4900 XPM109 B
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.579 × 10⁹⁴(95-digit number)
15795304144773560614…37592265929113556479
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.579 × 10⁹⁴(95-digit number)
15795304144773560614…37592265929113556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.159 × 10⁹⁴(95-digit number)
31590608289547121228…75184531858227112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.318 × 10⁹⁴(95-digit number)
63181216579094242457…50369063716454225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.263 × 10⁹⁵(96-digit number)
12636243315818848491…00738127432908451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.527 × 10⁹⁵(96-digit number)
25272486631637696983…01476254865816903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.054 × 10⁹⁵(96-digit number)
50544973263275393966…02952509731633807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.010 × 10⁹⁶(97-digit number)
10108994652655078793…05905019463267614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.021 × 10⁹⁶(97-digit number)
20217989305310157586…11810038926535229439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.043 × 10⁹⁶(97-digit number)
40435978610620315172…23620077853070458879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.087 × 10⁹⁶(97-digit number)
80871957221240630345…47240155706140917759
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,935,084 XPM·at block #6,836,352 · 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