Block #402,774

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2014, 4:23:07 PM · Difficulty 10.4368 · 6,424,230 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2e2599ac8fe1a269f21f04eddae584c4234d5e04c38d0b1d901dd4ddb08f4331

Height

#402,774

Difficulty

10.436785

Transactions

7

Size

2.10 KB

Version

2

Bits

0a6fd121

Nonce

76,634

Timestamp

2/13/2014, 4:23:07 PM

Confirmations

6,424,230

Merkle Root

445339a10f731f55b074ad3e92e863127af2f39ca709ad443ae611b3f865713c
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.

9.644 × 10¹⁰¹(102-digit number)
96448832013850346444…98277427780210703999
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
9.644 × 10¹⁰¹(102-digit number)
96448832013850346444…98277427780210703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.928 × 10¹⁰²(103-digit number)
19289766402770069288…96554855560421407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.857 × 10¹⁰²(103-digit number)
38579532805540138577…93109711120842815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.715 × 10¹⁰²(103-digit number)
77159065611080277155…86219422241685631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.543 × 10¹⁰³(104-digit number)
15431813122216055431…72438844483371263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.086 × 10¹⁰³(104-digit number)
30863626244432110862…44877688966742527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.172 × 10¹⁰³(104-digit number)
61727252488864221724…89755377933485055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.234 × 10¹⁰⁴(105-digit number)
12345450497772844344…79510755866970111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.469 × 10¹⁰⁴(105-digit number)
24690900995545688689…59021511733940223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.938 × 10¹⁰⁴(105-digit number)
49381801991091377379…18043023467880447999
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,860,208 XPM·at block #6,827,003 · 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