Block #494,918

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 9:51:05 AM · Difficulty 10.7269 · 6,320,950 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
30ced400a749e8e4580447dd97d1ae70ee0e7d3d3e2e5c837ac2bcaec076b797

Height

#494,918

Difficulty

10.726919

Transactions

4

Size

17.91 KB

Version

2

Bits

0aba1757

Nonce

134,729,538

Timestamp

4/16/2014, 9:51:05 AM

Confirmations

6,320,950

Merkle Root

14683370397ad0685d003572af9b9a162198e40668b49cc5ac4841f265ee9424
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.

5.907 × 10⁹⁹(100-digit number)
59078975067443979639…14486871474534133759
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
5.907 × 10⁹⁹(100-digit number)
59078975067443979639…14486871474534133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.181 × 10¹⁰⁰(101-digit number)
11815795013488795927…28973742949068267519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.363 × 10¹⁰⁰(101-digit number)
23631590026977591855…57947485898136535039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.726 × 10¹⁰⁰(101-digit number)
47263180053955183711…15894971796273070079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.452 × 10¹⁰⁰(101-digit number)
94526360107910367423…31789943592546140159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.890 × 10¹⁰¹(102-digit number)
18905272021582073484…63579887185092280319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.781 × 10¹⁰¹(102-digit number)
37810544043164146969…27159774370184560639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.562 × 10¹⁰¹(102-digit number)
75621088086328293939…54319548740369121279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.512 × 10¹⁰²(103-digit number)
15124217617265658787…08639097480738242559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.024 × 10¹⁰²(103-digit number)
30248435234531317575…17278194961476485119
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,771,057 XPM·at block #6,815,867 · 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