Block #1,399,018

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2016, 5:37:43 PM · Difficulty 10.8074 · 5,411,122 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
53122a0b4b2804b2a7b2f0026f2a802df676e13cbf614477437c5c1bb40d71d5

Height

#1,399,018

Difficulty

10.807353

Transactions

47

Size

16.41 KB

Version

2

Bits

0aceaeae

Nonce

777,344,510

Timestamp

1/4/2016, 5:37:43 PM

Confirmations

5,411,122

Merkle Root

629a1ffb32e1acf17f4fba31d7581be18555278894a3a331209fb84eb6095155
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.121 × 10⁹⁵(96-digit number)
11218035028587586483…31740432899506419681
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.121 × 10⁹⁵(96-digit number)
11218035028587586483…31740432899506419681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.243 × 10⁹⁵(96-digit number)
22436070057175172966…63480865799012839361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.487 × 10⁹⁵(96-digit number)
44872140114350345933…26961731598025678721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.974 × 10⁹⁵(96-digit number)
89744280228700691867…53923463196051357441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.794 × 10⁹⁶(97-digit number)
17948856045740138373…07846926392102714881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.589 × 10⁹⁶(97-digit number)
35897712091480276746…15693852784205429761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.179 × 10⁹⁶(97-digit number)
71795424182960553493…31387705568410859521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.435 × 10⁹⁷(98-digit number)
14359084836592110698…62775411136821719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.871 × 10⁹⁷(98-digit number)
28718169673184221397…25550822273643438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.743 × 10⁹⁷(98-digit number)
57436339346368442794…51101644547286876161
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,725,188 XPM·at block #6,810,139 · 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.

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