Block #1,443,875

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2016, 5:06:26 PM · Difficulty 10.7578 · 5,396,389 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
15442ace7e1ff2d8b40762e3109720954bcd5bc5d8cdd463c5b78f981ea50bf5

Height

#1,443,875

Difficulty

10.757819

Transactions

2

Size

2.59 KB

Version

2

Bits

0ac20068

Nonce

111,151,798

Timestamp

2/5/2016, 5:06:26 PM

Confirmations

5,396,389

Merkle Root

b8cae62c478060e3812725ee65b6ced90c8525283a8bec48c64aa10df2c15120
Transactions (2)
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.

9.653 × 10⁹³(94-digit number)
96537002094172885730…67787575317898965751
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
9.653 × 10⁹³(94-digit number)
96537002094172885730…67787575317898965751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.930 × 10⁹⁴(95-digit number)
19307400418834577146…35575150635797931501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.861 × 10⁹⁴(95-digit number)
38614800837669154292…71150301271595863001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.722 × 10⁹⁴(95-digit number)
77229601675338308584…42300602543191726001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.544 × 10⁹⁵(96-digit number)
15445920335067661716…84601205086383452001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.089 × 10⁹⁵(96-digit number)
30891840670135323433…69202410172766904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.178 × 10⁹⁵(96-digit number)
61783681340270646867…38404820345533808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.235 × 10⁹⁶(97-digit number)
12356736268054129373…76809640691067616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.471 × 10⁹⁶(97-digit number)
24713472536108258746…53619281382135232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.942 × 10⁹⁶(97-digit number)
49426945072216517493…07238562764270464001
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,966,426 XPM·at block #6,840,263 · 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