Block #3,007,667

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2019, 9:13:36 AM · Difficulty 11.2072 · 3,830,749 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0639665ecb68d5acedba70fe2a07e7a3ee4440ef3e516d0f91108df910998647

Height

#3,007,667

Difficulty

11.207166

Transactions

32

Size

7.74 KB

Version

2

Bits

0b3508d1

Nonce

139,906,039

Timestamp

1/13/2019, 9:13:36 AM

Confirmations

3,830,749

Merkle Root

63a586ef6c9937c2af551e0c3fbc1103987863a9466513f94f4b728a9a3427d9
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.

4.985 × 10⁹⁴(95-digit number)
49852567853294945085…41386081790168888319
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
4.985 × 10⁹⁴(95-digit number)
49852567853294945085…41386081790168888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.970 × 10⁹⁴(95-digit number)
99705135706589890171…82772163580337776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.994 × 10⁹⁵(96-digit number)
19941027141317978034…65544327160675553279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.988 × 10⁹⁵(96-digit number)
39882054282635956068…31088654321351106559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.976 × 10⁹⁵(96-digit number)
79764108565271912137…62177308642702213119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.595 × 10⁹⁶(97-digit number)
15952821713054382427…24354617285404426239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.190 × 10⁹⁶(97-digit number)
31905643426108764854…48709234570808852479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.381 × 10⁹⁶(97-digit number)
63811286852217529709…97418469141617704959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.276 × 10⁹⁷(98-digit number)
12762257370443505941…94836938283235409919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.552 × 10⁹⁷(98-digit number)
25524514740887011883…89673876566470819839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.104 × 10⁹⁷(98-digit number)
51049029481774023767…79347753132941639679
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,951,601 XPM·at block #6,838,415 · 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