Block #2,950,020

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2018, 9:04:30 AM · Difficulty 11.3977 · 3,881,082 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
709dbc979b53951e07d6a29efab9dd869e9ecaa7f7e14c6a4e2b82a571d8e433

Height

#2,950,020

Difficulty

11.397709

Transactions

33

Size

9.99 KB

Version

2

Bits

0b65d047

Nonce

74,695,682

Timestamp

12/3/2018, 9:04:30 AM

Confirmations

3,881,082

Merkle Root

736ba6df11155362c9195c8eef6c7daa1b86f8edd4baab422f0e50722e87b7e3
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.

3.026 × 10⁹⁴(95-digit number)
30267242549570525389…38455854452878492959
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
3.026 × 10⁹⁴(95-digit number)
30267242549570525389…38455854452878492959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.053 × 10⁹⁴(95-digit number)
60534485099141050779…76911708905756985919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.210 × 10⁹⁵(96-digit number)
12106897019828210155…53823417811513971839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.421 × 10⁹⁵(96-digit number)
24213794039656420311…07646835623027943679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.842 × 10⁹⁵(96-digit number)
48427588079312840623…15293671246055887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.685 × 10⁹⁵(96-digit number)
96855176158625681246…30587342492111774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.937 × 10⁹⁶(97-digit number)
19371035231725136249…61174684984223549439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.874 × 10⁹⁶(97-digit number)
38742070463450272498…22349369968447098879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.748 × 10⁹⁶(97-digit number)
77484140926900544997…44698739936894197759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.549 × 10⁹⁷(98-digit number)
15496828185380108999…89397479873788395519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.099 × 10⁹⁷(98-digit number)
30993656370760217998…78794959747576791039
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,892,959 XPM·at block #6,831,101 · 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