Block #3,121,003

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2019, 6:12:48 AM · Difficulty 11.2717 · 3,694,062 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d479c6a090d8777e730f8871ecfc687b1b79ed0defc9a86690f5c87bb2092b34

Height

#3,121,003

Difficulty

11.271654

Transactions

2

Size

870 B

Version

2

Bits

0b458b26

Nonce

1,197,266,753

Timestamp

4/2/2019, 6:12:48 AM

Confirmations

3,694,062

Merkle Root

2b13b12b9ad30c9ca522be15e7ef4e0c89909323109f5275a6fbcd5f7cca7e5d
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.144 × 10⁹⁵(96-digit number)
21447318284859824387…32040683242910661121
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.144 × 10⁹⁵(96-digit number)
21447318284859824387…32040683242910661121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.289 × 10⁹⁵(96-digit number)
42894636569719648775…64081366485821322241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.578 × 10⁹⁵(96-digit number)
85789273139439297551…28162732971642644481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.715 × 10⁹⁶(97-digit number)
17157854627887859510…56325465943285288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.431 × 10⁹⁶(97-digit number)
34315709255775719020…12650931886570577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.863 × 10⁹⁶(97-digit number)
68631418511551438041…25301863773141155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.372 × 10⁹⁷(98-digit number)
13726283702310287608…50603727546282311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.745 × 10⁹⁷(98-digit number)
27452567404620575216…01207455092564623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.490 × 10⁹⁷(98-digit number)
54905134809241150433…02414910185129246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.098 × 10⁹⁸(99-digit number)
10981026961848230086…04829820370258493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.196 × 10⁹⁸(99-digit number)
21962053923696460173…09659640740516986881
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,764,612 XPM·at block #6,815,064 · 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