Block #493,643

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 6:58:37 PM · Difficulty 10.7049 · 6,320,477 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
49a1c38d19e95ce916a6d59d273869e8caa61b0beebbeba02e72f52899411f6c

Height

#493,643

Difficulty

10.704872

Transactions

3

Size

654 B

Version

2

Bits

0ab4727f

Nonce

16,478

Timestamp

4/15/2014, 6:58:37 PM

Confirmations

6,320,477

Merkle Root

071b31b169480ffcefbe8219de9c2eab91e3f1a207ab4ae03420de27b5b3a752
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.306 × 10⁹⁷(98-digit number)
33068962666954790578…74153362567375983359
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.306 × 10⁹⁷(98-digit number)
33068962666954790578…74153362567375983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.613 × 10⁹⁷(98-digit number)
66137925333909581156…48306725134751966719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.322 × 10⁹⁸(99-digit number)
13227585066781916231…96613450269503933439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.645 × 10⁹⁸(99-digit number)
26455170133563832462…93226900539007866879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.291 × 10⁹⁸(99-digit number)
52910340267127664925…86453801078015733759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.058 × 10⁹⁹(100-digit number)
10582068053425532985…72907602156031467519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.116 × 10⁹⁹(100-digit number)
21164136106851065970…45815204312062935039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.232 × 10⁹⁹(100-digit number)
42328272213702131940…91630408624125870079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.465 × 10⁹⁹(100-digit number)
84656544427404263880…83260817248251740159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.693 × 10¹⁰⁰(101-digit number)
16931308885480852776…66521634496503480319
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,757,043 XPM·at block #6,814,119 · 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