Block #281,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 12:35:41 AM · Difficulty 9.9770 · 6,527,752 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e3da6cff4f242d2845c364bb97a1c3370fb69267332e05963784fe7d308d75df

Height

#281,419

Difficulty

9.976978

Transactions

6

Size

2.50 KB

Version

2

Bits

09fa1b43

Nonce

2,553

Timestamp

11/29/2013, 12:35:41 AM

Confirmations

6,527,752

Merkle Root

ca0381fccd4bb4bcd787827910ce666d9d722d3b42ae65af53600cafb7de1b7c
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.625 × 10¹⁰¹(102-digit number)
26250630923860996501…80034032878737311639
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.625 × 10¹⁰¹(102-digit number)
26250630923860996501…80034032878737311639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.250 × 10¹⁰¹(102-digit number)
52501261847721993002…60068065757474623279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.050 × 10¹⁰²(103-digit number)
10500252369544398600…20136131514949246559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.100 × 10¹⁰²(103-digit number)
21000504739088797200…40272263029898493119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.200 × 10¹⁰²(103-digit number)
42001009478177594401…80544526059796986239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.400 × 10¹⁰²(103-digit number)
84002018956355188803…61089052119593972479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.680 × 10¹⁰³(104-digit number)
16800403791271037760…22178104239187944959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.360 × 10¹⁰³(104-digit number)
33600807582542075521…44356208478375889919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.720 × 10¹⁰³(104-digit number)
67201615165084151042…88712416956751779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.344 × 10¹⁰⁴(105-digit number)
13440323033016830208…77424833913503559679
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,431 XPM·at block #6,809,170 · 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