Block #2,933,603

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/21/2018, 11:35:17 PM · Difficulty 11.3958 · 3,898,084 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6188284ecce043f24dd482d453382b3f72c75582b7116788dbc479d3580fc9ec

Height

#2,933,603

Difficulty

11.395827

Transactions

6

Size

2.26 KB

Version

2

Bits

0b6554eb

Nonce

1,195,510,382

Timestamp

11/21/2018, 11:35:17 PM

Confirmations

3,898,084

Merkle Root

016934e2456f58952a49a63c89d208a6da02f8836f83f5d6b1e8c112e68aed91
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.

5.968 × 10⁹⁶(97-digit number)
59686593576295873576…53124333603416422401
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
5.968 × 10⁹⁶(97-digit number)
59686593576295873576…53124333603416422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.193 × 10⁹⁷(98-digit number)
11937318715259174715…06248667206832844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.387 × 10⁹⁷(98-digit number)
23874637430518349430…12497334413665689601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.774 × 10⁹⁷(98-digit number)
47749274861036698861…24994668827331379201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.549 × 10⁹⁷(98-digit number)
95498549722073397722…49989337654662758401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.909 × 10⁹⁸(99-digit number)
19099709944414679544…99978675309325516801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.819 × 10⁹⁸(99-digit number)
38199419888829359089…99957350618651033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.639 × 10⁹⁸(99-digit number)
76398839777658718178…99914701237302067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.527 × 10⁹⁹(100-digit number)
15279767955531743635…99829402474604134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.055 × 10⁹⁹(100-digit number)
30559535911063487271…99658804949208268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.111 × 10⁹⁹(100-digit number)
61119071822126974542…99317609898416537601
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,897,603 XPM·at block #6,831,686 · 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