Block #491,289

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 10:14:55 AM · Difficulty 10.6808 · 6,333,904 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
69fc0e76875bf420b72b7ee15c398b7521c614f8906c386dfce0272390a8fee8

Height

#491,289

Difficulty

10.680759

Transactions

9

Size

2.11 KB

Version

2

Bits

0aae4631

Nonce

112,394

Timestamp

4/14/2014, 10:14:55 AM

Confirmations

6,333,904

Merkle Root

2a9bb6fdaee3bb16b8dee1df1b17a800db1d658c804ce5f0c9b3593be2b640ef
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.926 × 10⁹⁹(100-digit number)
29269518896764390356…20939865825370278399
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.926 × 10⁹⁹(100-digit number)
29269518896764390356…20939865825370278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.853 × 10⁹⁹(100-digit number)
58539037793528780712…41879731650740556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.170 × 10¹⁰⁰(101-digit number)
11707807558705756142…83759463301481113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.341 × 10¹⁰⁰(101-digit number)
23415615117411512284…67518926602962227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.683 × 10¹⁰⁰(101-digit number)
46831230234823024569…35037853205924454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.366 × 10¹⁰⁰(101-digit number)
93662460469646049139…70075706411848908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.873 × 10¹⁰¹(102-digit number)
18732492093929209827…40151412823697817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.746 × 10¹⁰¹(102-digit number)
37464984187858419655…80302825647395635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.492 × 10¹⁰¹(102-digit number)
74929968375716839311…60605651294791270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.498 × 10¹⁰²(103-digit number)
14985993675143367862…21211302589582540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.997 × 10¹⁰²(103-digit number)
29971987350286735724…42422605179165081599
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,845,636 XPM·at block #6,825,192 · 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