Block #2,469,121

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2018, 7:39:59 AM · Difficulty 10.9600 · 4,372,000 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
758f59109cacec01ce08c00ae6a4012b77b1a0a41c47c59ebfb5333c3896e3d6

Height

#2,469,121

Difficulty

10.959956

Transactions

4

Size

1.11 KB

Version

2

Bits

0af5bfad

Nonce

920,561,953

Timestamp

1/12/2018, 7:39:59 AM

Confirmations

4,372,000

Merkle Root

e126c129f6d32683c8864b9c363971e978f7116a257a12cec5bcf342f0f2cc77
Transactions (4)
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.173 × 10⁹⁴(95-digit number)
21732408749098142237…37891120109874135041
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.173 × 10⁹⁴(95-digit number)
21732408749098142237…37891120109874135041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.346 × 10⁹⁴(95-digit number)
43464817498196284475…75782240219748270081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.692 × 10⁹⁴(95-digit number)
86929634996392568950…51564480439496540161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.738 × 10⁹⁵(96-digit number)
17385926999278513790…03128960878993080321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.477 × 10⁹⁵(96-digit number)
34771853998557027580…06257921757986160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.954 × 10⁹⁵(96-digit number)
69543707997114055160…12515843515972321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.390 × 10⁹⁶(97-digit number)
13908741599422811032…25031687031944642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.781 × 10⁹⁶(97-digit number)
27817483198845622064…50063374063889285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.563 × 10⁹⁶(97-digit number)
55634966397691244128…00126748127778570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.112 × 10⁹⁷(98-digit number)
11126993279538248825…00253496255557140481
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,973,336 XPM·at block #6,841,120 · 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