Block #2,047,646

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/1/2017, 4:59:04 AM · Difficulty 10.6875 · 4,790,457 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d245cfc361ab965e3fa0104be9b95e7ad58fb309332d9f59d6bd771f9b2a242e

Height

#2,047,646

Difficulty

10.687526

Transactions

2

Size

1016 B

Version

2

Bits

0ab001b9

Nonce

145,255,619

Timestamp

4/1/2017, 4:59:04 AM

Confirmations

4,790,457

Merkle Root

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

2.184 × 10⁹⁴(95-digit number)
21842143859681724417…51176376261786850999
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
2.184 × 10⁹⁴(95-digit number)
21842143859681724417…51176376261786850999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.368 × 10⁹⁴(95-digit number)
43684287719363448834…02352752523573701999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.736 × 10⁹⁴(95-digit number)
87368575438726897669…04705505047147403999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.747 × 10⁹⁵(96-digit number)
17473715087745379533…09411010094294807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.494 × 10⁹⁵(96-digit number)
34947430175490759067…18822020188589615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.989 × 10⁹⁵(96-digit number)
69894860350981518135…37644040377179231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.397 × 10⁹⁶(97-digit number)
13978972070196303627…75288080754358463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.795 × 10⁹⁶(97-digit number)
27957944140392607254…50576161508716927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.591 × 10⁹⁶(97-digit number)
55915888280785214508…01152323017433855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.118 × 10⁹⁷(98-digit number)
11183177656157042901…02304646034867711999
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,949,177 XPM·at block #6,838,102 · 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