Block #1,316,344

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2015, 2:02:08 AM · Difficulty 10.8623 · 5,509,277 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9007e4990c7ab459db4d6a5479717eefc81c2f96eefaad2498562965976643c6

Height

#1,316,344

Difficulty

10.862286

Transactions

2

Size

833 B

Version

2

Bits

0adcbeca

Nonce

1,801,670,196

Timestamp

11/7/2015, 2:02:08 AM

Confirmations

5,509,277

Merkle Root

2980b63369ed6e62a682742226b6c85c8c4e3a3ce21fcb6d9e054f2dec48689e
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.780 × 10⁹³(94-digit number)
27809783469571740382…62376635725543005221
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.780 × 10⁹³(94-digit number)
27809783469571740382…62376635725543005221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.561 × 10⁹³(94-digit number)
55619566939143480764…24753271451086010441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.112 × 10⁹⁴(95-digit number)
11123913387828696152…49506542902172020881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.224 × 10⁹⁴(95-digit number)
22247826775657392305…99013085804344041761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.449 × 10⁹⁴(95-digit number)
44495653551314784611…98026171608688083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.899 × 10⁹⁴(95-digit number)
88991307102629569222…96052343217376167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.779 × 10⁹⁵(96-digit number)
17798261420525913844…92104686434752334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.559 × 10⁹⁵(96-digit number)
35596522841051827689…84209372869504668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.119 × 10⁹⁵(96-digit number)
71193045682103655378…68418745739009336321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.423 × 10⁹⁶(97-digit number)
14238609136420731075…36837491478018672641
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,849,070 XPM·at block #6,825,620 · 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