Block #419,113

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 9:13:14 AM · Difficulty 10.3851 · 6,387,461 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba308ff0006b7459676c90071f1d7bbb20b9665b7a7803d088301e5bf98c4c40

Height

#419,113

Difficulty

10.385135

Transactions

4

Size

886 B

Version

2

Bits

0a629838

Nonce

28,094

Timestamp

2/25/2014, 9:13:14 AM

Confirmations

6,387,461

Merkle Root

fdd65ba4b80b3091596ead6ae25764239464ef7c9d6835217b551f71f62d77f1
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.887 × 10⁹⁸(99-digit number)
38870515555526730088…25706174144788036159
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.887 × 10⁹⁸(99-digit number)
38870515555526730088…25706174144788036159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.774 × 10⁹⁸(99-digit number)
77741031111053460177…51412348289576072319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.554 × 10⁹⁹(100-digit number)
15548206222210692035…02824696579152144639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.109 × 10⁹⁹(100-digit number)
31096412444421384070…05649393158304289279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.219 × 10⁹⁹(100-digit number)
62192824888842768141…11298786316608578559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.243 × 10¹⁰⁰(101-digit number)
12438564977768553628…22597572633217157119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.487 × 10¹⁰⁰(101-digit number)
24877129955537107256…45195145266434314239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.975 × 10¹⁰⁰(101-digit number)
49754259911074214513…90390290532868628479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.950 × 10¹⁰⁰(101-digit number)
99508519822148429026…80780581065737256959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.990 × 10¹⁰¹(102-digit number)
19901703964429685805…61561162131474513919
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,696,686 XPM·at block #6,806,573 · 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