Block #351,939

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 12:49:55 AM · Difficulty 10.3009 · 6,466,012 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0117e85236d670ec07ab6aae96875dda1dc92360ddf4f376b1c068b801006d2e

Height

#351,939

Difficulty

10.300936

Transactions

4

Size

5.05 KB

Version

2

Bits

0a4d0a1e

Nonce

2,836

Timestamp

1/10/2014, 12:49:55 AM

Confirmations

6,466,012

Merkle Root

081fa2bac5bd3b5e7071edd9a879ec03d2f605b0d244ebba4ec4128ec5caedb3
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.

7.957 × 10¹⁰⁰(101-digit number)
79576595683777289355…93131174242444487679
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
7.957 × 10¹⁰⁰(101-digit number)
79576595683777289355…93131174242444487679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.591 × 10¹⁰¹(102-digit number)
15915319136755457871…86262348484888975359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.183 × 10¹⁰¹(102-digit number)
31830638273510915742…72524696969777950719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.366 × 10¹⁰¹(102-digit number)
63661276547021831484…45049393939555901439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.273 × 10¹⁰²(103-digit number)
12732255309404366296…90098787879111802879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.546 × 10¹⁰²(103-digit number)
25464510618808732593…80197575758223605759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.092 × 10¹⁰²(103-digit number)
50929021237617465187…60395151516447211519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.018 × 10¹⁰³(104-digit number)
10185804247523493037…20790303032894423039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.037 × 10¹⁰³(104-digit number)
20371608495046986074…41580606065788846079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.074 × 10¹⁰³(104-digit number)
40743216990093972149…83161212131577692159
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,787,676 XPM·at block #6,817,950 · 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.
Privacy Policy·

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