Block #347,403

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 4:19:24 AM · Difficulty 10.2383 · 6,460,226 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4c3878a58f5ff3610bb5bd8c62324c963f01bdde2ead69257ff265eed6a69378

Height

#347,403

Difficulty

10.238251

Transactions

9

Size

2.54 KB

Version

2

Bits

0a3cfe08

Nonce

51,254

Timestamp

1/7/2014, 4:19:24 AM

Confirmations

6,460,226

Merkle Root

57098c7902de1c2e88abc8d0ae45953648180778e2678da6fa5adcad8885ba12
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.

9.194 × 10⁹⁹(100-digit number)
91943791626058967491…36798649170875816959
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
9.194 × 10⁹⁹(100-digit number)
91943791626058967491…36798649170875816959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.838 × 10¹⁰⁰(101-digit number)
18388758325211793498…73597298341751633919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.677 × 10¹⁰⁰(101-digit number)
36777516650423586996…47194596683503267839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.355 × 10¹⁰⁰(101-digit number)
73555033300847173992…94389193367006535679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.471 × 10¹⁰¹(102-digit number)
14711006660169434798…88778386734013071359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.942 × 10¹⁰¹(102-digit number)
29422013320338869597…77556773468026142719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.884 × 10¹⁰¹(102-digit number)
58844026640677739194…55113546936052285439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.176 × 10¹⁰²(103-digit number)
11768805328135547838…10227093872104570879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.353 × 10¹⁰²(103-digit number)
23537610656271095677…20454187744209141759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.707 × 10¹⁰²(103-digit number)
47075221312542191355…40908375488418283519
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,705,057 XPM·at block #6,807,628 · 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