Block #1,429,257

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2016, 7:05:45 PM · Difficulty 10.7402 · 5,388,660 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5594c7bda4ca79fa384a373a9b50b4179a29fe42353e100bc6d75af0a01886e1

Height

#1,429,257

Difficulty

10.740217

Transactions

2

Size

1.01 KB

Version

2

Bits

0abd7edf

Nonce

973,776,822

Timestamp

1/26/2016, 7:05:45 PM

Confirmations

5,388,660

Merkle Root

2075293f103232e7fb9be9790fd97919de0647ef3061e0f7438bbbbf19b87e90
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.070 × 10⁹⁵(96-digit number)
20705691377483361194…64300490244964505921
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.070 × 10⁹⁵(96-digit number)
20705691377483361194…64300490244964505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.141 × 10⁹⁵(96-digit number)
41411382754966722388…28600980489929011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.282 × 10⁹⁵(96-digit number)
82822765509933444776…57201960979858023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.656 × 10⁹⁶(97-digit number)
16564553101986688955…14403921959716047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.312 × 10⁹⁶(97-digit number)
33129106203973377910…28807843919432094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.625 × 10⁹⁶(97-digit number)
66258212407946755821…57615687838864189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.325 × 10⁹⁷(98-digit number)
13251642481589351164…15231375677728378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.650 × 10⁹⁷(98-digit number)
26503284963178702328…30462751355456757761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.300 × 10⁹⁷(98-digit number)
53006569926357404657…60925502710913515521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.060 × 10⁹⁸(99-digit number)
10601313985271480931…21851005421827031041
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,787,401 XPM·at block #6,817,916 · 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