Block #346,619

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 4:05:18 PM · Difficulty 10.2305 · 6,462,550 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
25fe0db45f9f6acf535e56dac36de0b680001366dcea05fa74bcc02e84968004

Height

#346,619

Difficulty

10.230528

Transactions

1

Size

1.08 KB

Version

2

Bits

0a3b03dc

Nonce

21,340

Timestamp

1/6/2014, 4:05:18 PM

Confirmations

6,462,550

Merkle Root

1c3c131b32ef3b7b6438b3a2d425c7adc856146d80bdbd4f132d9f3bb2c3c2a9
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.069 × 10¹⁰⁰(101-digit number)
90699420517129142558…94840220614513049599
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.069 × 10¹⁰⁰(101-digit number)
90699420517129142558…94840220614513049599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.813 × 10¹⁰¹(102-digit number)
18139884103425828511…89680441229026099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.627 × 10¹⁰¹(102-digit number)
36279768206851657023…79360882458052198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.255 × 10¹⁰¹(102-digit number)
72559536413703314046…58721764916104396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.451 × 10¹⁰²(103-digit number)
14511907282740662809…17443529832208793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.902 × 10¹⁰²(103-digit number)
29023814565481325618…34887059664417587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.804 × 10¹⁰²(103-digit number)
58047629130962651237…69774119328835174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.160 × 10¹⁰³(104-digit number)
11609525826192530247…39548238657670348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.321 × 10¹⁰³(104-digit number)
23219051652385060494…79096477315340697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.643 × 10¹⁰³(104-digit number)
46438103304770120989…58192954630681395199
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,717,414 XPM·at block #6,809,168 · 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