Block #477,639

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/6/2014, 1:58:47 PM · Difficulty 10.4862 · 6,332,037 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2ae52b9ae167865d3604fcb1fa5689d0d9b0bfa1790e6eb5d3b854fbc7202768

Height

#477,639

Difficulty

10.486183

Transactions

1

Size

835 B

Version

2

Bits

0a7c7679

Nonce

41,842

Timestamp

4/6/2014, 1:58:47 PM

Confirmations

6,332,037

Merkle Root

893727207a965a700147b3337efcaf2b23b79586ec9a1595f1745e87817b9055
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.582 × 10⁹⁸(99-digit number)
35829843257348015407…57742273277068567279
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.582 × 10⁹⁸(99-digit number)
35829843257348015407…57742273277068567279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.165 × 10⁹⁸(99-digit number)
71659686514696030815…15484546554137134559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.433 × 10⁹⁹(100-digit number)
14331937302939206163…30969093108274269119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.866 × 10⁹⁹(100-digit number)
28663874605878412326…61938186216548538239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.732 × 10⁹⁹(100-digit number)
57327749211756824652…23876372433097076479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.146 × 10¹⁰⁰(101-digit number)
11465549842351364930…47752744866194152959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.293 × 10¹⁰⁰(101-digit number)
22931099684702729861…95505489732388305919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.586 × 10¹⁰⁰(101-digit number)
45862199369405459722…91010979464776611839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.172 × 10¹⁰⁰(101-digit number)
91724398738810919444…82021958929553223679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.834 × 10¹⁰¹(102-digit number)
18344879747762183888…64043917859106447359
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,721,484 XPM·at block #6,809,675 · 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