Block #449,102

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 9:31:16 AM · Difficulty 10.3673 · 6,361,270 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7ed6ca04e189d1f56a69abfa3b43950d136b719b72bf4432c29d342f7762a5c1

Height

#449,102

Difficulty

10.367254

Transactions

3

Size

1.24 KB

Version

2

Bits

0a5e0456

Nonce

217,511

Timestamp

3/18/2014, 9:31:16 AM

Confirmations

6,361,270

Merkle Root

2367ee5404b65bc73ec079fb6912be76951be987d5fbcfaf148841dedb27d20c
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.707 × 10⁹⁷(98-digit number)
57075545918599026920…41440429411936424799
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.707 × 10⁹⁷(98-digit number)
57075545918599026920…41440429411936424799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.141 × 10⁹⁸(99-digit number)
11415109183719805384…82880858823872849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.283 × 10⁹⁸(99-digit number)
22830218367439610768…65761717647745699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.566 × 10⁹⁸(99-digit number)
45660436734879221536…31523435295491398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.132 × 10⁹⁸(99-digit number)
91320873469758443073…63046870590982796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.826 × 10⁹⁹(100-digit number)
18264174693951688614…26093741181965593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.652 × 10⁹⁹(100-digit number)
36528349387903377229…52187482363931187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.305 × 10⁹⁹(100-digit number)
73056698775806754458…04374964727862374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.461 × 10¹⁰⁰(101-digit number)
14611339755161350891…08749929455724748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.922 × 10¹⁰⁰(101-digit number)
29222679510322701783…17499858911449497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.844 × 10¹⁰⁰(101-digit number)
58445359020645403566…34999717822898995199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,727,053 XPM·at block #6,810,371 · 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