Block #1,315,519

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/6/2015, 12:33:12 PM · Difficulty 10.8618 · 5,509,849 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c20afffae63224319001807602342d708bd5269fec7ce96d9874777b0efb411

Height

#1,315,519

Difficulty

10.861828

Transactions

2

Size

17.62 KB

Version

2

Bits

0adca0c6

Nonce

2,051,172,386

Timestamp

11/6/2015, 12:33:12 PM

Confirmations

5,509,849

Merkle Root

82ed8fe5de96193bb2e044b0e3f1155612b36899ed291f973bf48e2dc0630977
Transactions (2)
1 in → 1 out8.6600 XPM110 B
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.171 × 10⁹⁷(98-digit number)
11713649522264702376…31362514137064857601
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.171 × 10⁹⁷(98-digit number)
11713649522264702376…31362514137064857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.342 × 10⁹⁷(98-digit number)
23427299044529404752…62725028274129715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.685 × 10⁹⁷(98-digit number)
46854598089058809504…25450056548259430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.370 × 10⁹⁷(98-digit number)
93709196178117619008…50900113096518860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.874 × 10⁹⁸(99-digit number)
18741839235623523801…01800226193037721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.748 × 10⁹⁸(99-digit number)
37483678471247047603…03600452386075443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.496 × 10⁹⁸(99-digit number)
74967356942494095206…07200904772150886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.499 × 10⁹⁹(100-digit number)
14993471388498819041…14401809544301772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.998 × 10⁹⁹(100-digit number)
29986942776997638082…28803619088603545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.997 × 10⁹⁹(100-digit number)
59973885553995276165…57607238177207091201
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,847,041 XPM·at block #6,825,367 · 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