Block #469,347

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/1/2014, 4:17:00 AM · Difficulty 10.4269 · 6,339,667 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8c0c8c2968f18316aa6720330b44ea9d0cab45ed73675384eda64076c7318cf

Height

#469,347

Difficulty

10.426917

Transactions

2

Size

1015 B

Version

2

Bits

0a6d4a6e

Nonce

41,004

Timestamp

4/1/2014, 4:17:00 AM

Confirmations

6,339,667

Merkle Root

4c3a5743e2812f71fdd125e8e2e32284e3b1a11becfb4755ec27bcacd2ffe7f2
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.

2.459 × 10⁹⁹(100-digit number)
24593918213965292549…64537628939430011199
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
2.459 × 10⁹⁹(100-digit number)
24593918213965292549…64537628939430011199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.918 × 10⁹⁹(100-digit number)
49187836427930585098…29075257878860022399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.837 × 10⁹⁹(100-digit number)
98375672855861170197…58150515757720044799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.967 × 10¹⁰⁰(101-digit number)
19675134571172234039…16301031515440089599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.935 × 10¹⁰⁰(101-digit number)
39350269142344468078…32602063030880179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.870 × 10¹⁰⁰(101-digit number)
78700538284688936157…65204126061760358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.574 × 10¹⁰¹(102-digit number)
15740107656937787231…30408252123520716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.148 × 10¹⁰¹(102-digit number)
31480215313875574463…60816504247041433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.296 × 10¹⁰¹(102-digit number)
62960430627751148926…21633008494082867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.259 × 10¹⁰²(103-digit number)
12592086125550229785…43266016988165734399
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,173 XPM·at block #6,809,013 · 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