Block #349,687

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 1:48:48 PM · Difficulty 10.2789 · 6,459,316 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0e6ca7befb86d6a695c70d84a0796522bab4d73b5a2cc1209d8d0fecf7b4b496

Height

#349,687

Difficulty

10.278919

Transactions

6

Size

1.88 KB

Version

2

Bits

0a47673d

Nonce

7,788

Timestamp

1/8/2014, 1:48:48 PM

Confirmations

6,459,316

Merkle Root

7b9e2855ef47a190535a4474fd3eafc42250969bad75c8b46c470d5ae9340458
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.

3.501 × 10¹⁰⁵(106-digit number)
35010105624128703518…97106751694876800959
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
3.501 × 10¹⁰⁵(106-digit number)
35010105624128703518…97106751694876800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.002 × 10¹⁰⁵(106-digit number)
70020211248257407036…94213503389753601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.400 × 10¹⁰⁶(107-digit number)
14004042249651481407…88427006779507203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.800 × 10¹⁰⁶(107-digit number)
28008084499302962814…76854013559014407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.601 × 10¹⁰⁶(107-digit number)
56016168998605925629…53708027118028815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.120 × 10¹⁰⁷(108-digit number)
11203233799721185125…07416054236057630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.240 × 10¹⁰⁷(108-digit number)
22406467599442370251…14832108472115261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.481 × 10¹⁰⁷(108-digit number)
44812935198884740503…29664216944230522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.962 × 10¹⁰⁷(108-digit number)
89625870397769481006…59328433888461045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.792 × 10¹⁰⁸(109-digit number)
17925174079553896201…18656867776922091519
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,716,084 XPM·at block #6,809,002 · 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