Block #2,468,668

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2018, 11:43:26 PM · Difficulty 10.9601 · 4,370,756 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3c2f280c0ba3623ab1c6dd6ede91c30f632c23a4799afd7f39342258680382c

Height

#2,468,668

Difficulty

10.960100

Transactions

9

Size

2.51 KB

Version

2

Bits

0af5c91d

Nonce

936,449,036

Timestamp

1/11/2018, 11:43:26 PM

Confirmations

4,370,756

Merkle Root

bdd28e138ebcba895d956dfb4768bee81ece88ff11840b3a22c3ee03efd30fb6
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.533 × 10⁹⁵(96-digit number)
15333346046390946429…49712851679740560801
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.533 × 10⁹⁵(96-digit number)
15333346046390946429…49712851679740560801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.066 × 10⁹⁵(96-digit number)
30666692092781892858…99425703359481121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.133 × 10⁹⁵(96-digit number)
61333384185563785717…98851406718962243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.226 × 10⁹⁶(97-digit number)
12266676837112757143…97702813437924486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.453 × 10⁹⁶(97-digit number)
24533353674225514287…95405626875848972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.906 × 10⁹⁶(97-digit number)
49066707348451028574…90811253751697945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.813 × 10⁹⁶(97-digit number)
98133414696902057148…81622507503395891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.962 × 10⁹⁷(98-digit number)
19626682939380411429…63245015006791782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.925 × 10⁹⁷(98-digit number)
39253365878760822859…26490030013583564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.850 × 10⁹⁷(98-digit number)
78506731757521645718…52980060027167129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.570 × 10⁹⁸(99-digit number)
15701346351504329143…05960120054334259201
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,959,681 XPM·at block #6,839,423 · 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