Block #2,471,707

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2018, 9:57:17 PM · Difficulty 10.9622 · 4,371,404 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
30e0418b7f36a162386bbf5b77787587304d4e75ef205dfba8107ca322a3cb12

Height

#2,471,707

Difficulty

10.962233

Transactions

35

Size

11.12 KB

Version

2

Bits

0af654eb

Nonce

20,144,979

Timestamp

1/13/2018, 9:57:17 PM

Confirmations

4,371,404

Merkle Root

d0d1e75715dbd0b7036547570be219e8a5baf027ab218f44038da6e5e6de6544
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.138 × 10⁹⁴(95-digit number)
21380636086235351811…28619404575875229939
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.138 × 10⁹⁴(95-digit number)
21380636086235351811…28619404575875229939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.276 × 10⁹⁴(95-digit number)
42761272172470703623…57238809151750459879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.552 × 10⁹⁴(95-digit number)
85522544344941407247…14477618303500919759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.710 × 10⁹⁵(96-digit number)
17104508868988281449…28955236607001839519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.420 × 10⁹⁵(96-digit number)
34209017737976562898…57910473214003679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.841 × 10⁹⁵(96-digit number)
68418035475953125797…15820946428007358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.368 × 10⁹⁶(97-digit number)
13683607095190625159…31641892856014716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.736 × 10⁹⁶(97-digit number)
27367214190381250319…63283785712029432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.473 × 10⁹⁶(97-digit number)
54734428380762500638…26567571424058864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.094 × 10⁹⁷(98-digit number)
10946885676152500127…53135142848117729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.189 × 10⁹⁷(98-digit number)
21893771352305000255…06270285696235458559
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,989,253 XPM·at block #6,843,110 · 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