Block #344,378

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 6:46:58 AM · Difficulty 10.1922 · 6,466,725 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6287895712f0e41df65b1122227bfa1fcfa6eb40453313a5c93f2705f6d67b8e

Height

#344,378

Difficulty

10.192161

Transactions

11

Size

7.50 KB

Version

2

Bits

0a313179

Nonce

50,980

Timestamp

1/5/2014, 6:46:58 AM

Confirmations

6,466,725

Merkle Root

3be1c65d28df48ab0a69aed3920d067d6bebb1c23e010998c01e0c0cbfba7368
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.

4.167 × 10⁹⁷(98-digit number)
41677717144005340265…84489537229458754951
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
4.167 × 10⁹⁷(98-digit number)
41677717144005340265…84489537229458754951
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.335 × 10⁹⁷(98-digit number)
83355434288010680531…68979074458917509901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.667 × 10⁹⁸(99-digit number)
16671086857602136106…37958148917835019801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.334 × 10⁹⁸(99-digit number)
33342173715204272212…75916297835670039601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.668 × 10⁹⁸(99-digit number)
66684347430408544425…51832595671340079201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.333 × 10⁹⁹(100-digit number)
13336869486081708885…03665191342680158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.667 × 10⁹⁹(100-digit number)
26673738972163417770…07330382685360316801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.334 × 10⁹⁹(100-digit number)
53347477944326835540…14660765370720633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.066 × 10¹⁰⁰(101-digit number)
10669495588865367108…29321530741441267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.133 × 10¹⁰⁰(101-digit number)
21338991177730734216…58643061482882534401
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,732,931 XPM·at block #6,811,102 · 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