Block #356,740

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2014, 10:44:50 PM · Difficulty 10.3823 · 6,452,197 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
864775b79cf03d9075bf940d391d11849937a7d1f10d800910798faa028c49b9

Height

#356,740

Difficulty

10.382347

Transactions

10

Size

2.18 KB

Version

2

Bits

0a61e183

Nonce

12,538

Timestamp

1/12/2014, 10:44:50 PM

Confirmations

6,452,197

Merkle Root

96f1882b798ef50ba983b0180581b1d70a92dacfa4d6281b373f7eb553ad8aeb
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.163 × 10¹⁰⁰(101-digit number)
11631039452072469912…94526720328505036801
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.163 × 10¹⁰⁰(101-digit number)
11631039452072469912…94526720328505036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.326 × 10¹⁰⁰(101-digit number)
23262078904144939825…89053440657010073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.652 × 10¹⁰⁰(101-digit number)
46524157808289879651…78106881314020147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.304 × 10¹⁰⁰(101-digit number)
93048315616579759302…56213762628040294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.860 × 10¹⁰¹(102-digit number)
18609663123315951860…12427525256080588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.721 × 10¹⁰¹(102-digit number)
37219326246631903720…24855050512161177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.443 × 10¹⁰¹(102-digit number)
74438652493263807441…49710101024322355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.488 × 10¹⁰²(103-digit number)
14887730498652761488…99420202048644710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.977 × 10¹⁰²(103-digit number)
29775460997305522976…98840404097289420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.955 × 10¹⁰²(103-digit number)
59550921994611045953…97680808194578841601
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,715,553 XPM·at block #6,808,936 · 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