Block #469,167

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2014, 12:59:02 AM · Difficulty 10.4289 · 6,347,053 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3bb55891044972d504deeeeebe9491e942e59a7590934bedc6e1756b1663ea11

Height

#469,167

Difficulty

10.428902

Transactions

2

Size

5.20 KB

Version

2

Bits

0a6dcc85

Nonce

99,605

Timestamp

4/1/2014, 12:59:02 AM

Confirmations

6,347,053

Merkle Root

602dc50181d8937a5a7b95461b03a605368078d3749a08629b70a0c92119ed39
Transactions (2)
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.

1.213 × 10⁹⁹(100-digit number)
12134125608733789961…38458391931531014241
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
1.213 × 10⁹⁹(100-digit number)
12134125608733789961…38458391931531014241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.426 × 10⁹⁹(100-digit number)
24268251217467579923…76916783863062028481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.853 × 10⁹⁹(100-digit number)
48536502434935159846…53833567726124056961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.707 × 10⁹⁹(100-digit number)
97073004869870319693…07667135452248113921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.941 × 10¹⁰⁰(101-digit number)
19414600973974063938…15334270904496227841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.882 × 10¹⁰⁰(101-digit number)
38829201947948127877…30668541808992455681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.765 × 10¹⁰⁰(101-digit number)
77658403895896255754…61337083617984911361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.553 × 10¹⁰¹(102-digit number)
15531680779179251150…22674167235969822721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.106 × 10¹⁰¹(102-digit number)
31063361558358502301…45348334471939645441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.212 × 10¹⁰¹(102-digit number)
62126723116717004603…90696668943879290881
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,773,889 XPM·at block #6,816,219 · 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