Block #473,817

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/4/2014, 4:36:46 AM · Difficulty 10.4452 · 6,333,097 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1ce561cb9a09313bf3cfa50718884d7be490ed0b7bc99f72f8cdee5b3b7242f9

Height

#473,817

Difficulty

10.445183

Transactions

2

Size

696 B

Version

2

Bits

0a71f787

Nonce

86,261

Timestamp

4/4/2014, 4:36:46 AM

Confirmations

6,333,097

Merkle Root

4778a57e0b597a3627b15f06b22d5f982f16fe899338cd41eaf6506c556186a3
Transactions (2)
1 in → 1 out9.1600 XPM116 B
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.306 × 10⁹⁸(99-digit number)
53062595478467404326…39121075094892801011
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.306 × 10⁹⁸(99-digit number)
53062595478467404326…39121075094892801011
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.061 × 10⁹⁹(100-digit number)
10612519095693480865…78242150189785602021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.122 × 10⁹⁹(100-digit number)
21225038191386961730…56484300379571204041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.245 × 10⁹⁹(100-digit number)
42450076382773923461…12968600759142408081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.490 × 10⁹⁹(100-digit number)
84900152765547846923…25937201518284816161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.698 × 10¹⁰⁰(101-digit number)
16980030553109569384…51874403036569632321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.396 × 10¹⁰⁰(101-digit number)
33960061106219138769…03748806073139264641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.792 × 10¹⁰⁰(101-digit number)
67920122212438277538…07497612146278529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.358 × 10¹⁰¹(102-digit number)
13584024442487655507…14995224292557058561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.716 × 10¹⁰¹(102-digit number)
27168048884975311015…29990448585114117121
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,699,416 XPM·at block #6,806,913 · 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