Block #3,010,268

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2019, 5:03:48 AM · Difficulty 11.2028 · 3,829,959 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ae5edb0dc2acb82737f9768b0dfb89b89890d5bf995738f906cf0918fc86f41

Height

#3,010,268

Difficulty

11.202813

Transactions

20

Size

6.87 KB

Version

2

Bits

0b33eb8d

Nonce

109,701,596

Timestamp

1/15/2019, 5:03:48 AM

Confirmations

3,829,959

Merkle Root

4927b77857800bf133bc78f5e51a167be40cd0725a5284b269f29bc35dd7ed1b
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.

1.917 × 10⁹⁵(96-digit number)
19178082135190004866…26025180135378372801
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
1.917 × 10⁹⁵(96-digit number)
19178082135190004866…26025180135378372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.835 × 10⁹⁵(96-digit number)
38356164270380009732…52050360270756745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.671 × 10⁹⁵(96-digit number)
76712328540760019464…04100720541513491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.534 × 10⁹⁶(97-digit number)
15342465708152003892…08201441083026982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.068 × 10⁹⁶(97-digit number)
30684931416304007785…16402882166053964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.136 × 10⁹⁶(97-digit number)
61369862832608015571…32805764332107929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.227 × 10⁹⁷(98-digit number)
12273972566521603114…65611528664215859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.454 × 10⁹⁷(98-digit number)
24547945133043206228…31223057328431718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.909 × 10⁹⁷(98-digit number)
49095890266086412457…62446114656863436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.819 × 10⁹⁷(98-digit number)
98191780532172824915…24892229313726873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.963 × 10⁹⁸(99-digit number)
19638356106434564983…49784458627453747201
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,966,128 XPM·at block #6,840,226 · 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