Block #492,338

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 1:43:18 AM · Difficulty 10.6884 · 6,318,290 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9c8c9f55f8be7b36b8a0ac0193534aa9af3c55dcf994f3dd88eb437330b15f2c

Height

#492,338

Difficulty

10.688392

Transactions

1

Size

903 B

Version

2

Bits

0ab03a74

Nonce

299,742

Timestamp

4/15/2014, 1:43:18 AM

Confirmations

6,318,290

Merkle Root

d76c45eac52b50c3a2fe0b157ee4025e91cebfe47e1a50b3987f54f1f0b88db7
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.706 × 10⁹⁸(99-digit number)
27066287412433383694…32276862247269326079
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.706 × 10⁹⁸(99-digit number)
27066287412433383694…32276862247269326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.413 × 10⁹⁸(99-digit number)
54132574824866767388…64553724494538652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.082 × 10⁹⁹(100-digit number)
10826514964973353477…29107448989077304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.165 × 10⁹⁹(100-digit number)
21653029929946706955…58214897978154608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.330 × 10⁹⁹(100-digit number)
43306059859893413910…16429795956309217279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.661 × 10⁹⁹(100-digit number)
86612119719786827821…32859591912618434559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.732 × 10¹⁰⁰(101-digit number)
17322423943957365564…65719183825236869119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.464 × 10¹⁰⁰(101-digit number)
34644847887914731128…31438367650473738239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.928 × 10¹⁰⁰(101-digit number)
69289695775829462257…62876735300947476479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.385 × 10¹⁰¹(102-digit number)
13857939155165892451…25753470601894952959
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,729,110 XPM·at block #6,810,627 · 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