Block #344,597

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 9:52:27 AM · Difficulty 10.1973 · 6,463,142 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa080f2369fc7465ffa3c5d87bd3e43b57f488f68c0bfe6d48c5b02f5d79ef62

Height

#344,597

Difficulty

10.197259

Transactions

2

Size

3.05 KB

Version

2

Bits

0a327f98

Nonce

2,087

Timestamp

1/5/2014, 9:52:27 AM

Confirmations

6,463,142

Merkle Root

69d408dec7723c9279a45ce6825bf9bffe250ba0694e0074b625872597eba051
Transactions (2)
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.498 × 10¹⁰²(103-digit number)
14984644759545560492…82305901374407326721
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.498 × 10¹⁰²(103-digit number)
14984644759545560492…82305901374407326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.996 × 10¹⁰²(103-digit number)
29969289519091120984…64611802748814653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.993 × 10¹⁰²(103-digit number)
59938579038182241969…29223605497629306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.198 × 10¹⁰³(104-digit number)
11987715807636448393…58447210995258613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.397 × 10¹⁰³(104-digit number)
23975431615272896787…16894421990517227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.795 × 10¹⁰³(104-digit number)
47950863230545793575…33788843981034455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.590 × 10¹⁰³(104-digit number)
95901726461091587151…67577687962068910081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.918 × 10¹⁰⁴(105-digit number)
19180345292218317430…35155375924137820161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.836 × 10¹⁰⁴(105-digit number)
38360690584436634860…70310751848275640321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.672 × 10¹⁰⁴(105-digit number)
76721381168873269721…40621503696551280641
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,705,948 XPM·at block #6,807,738 · 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