Block #488,935

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 12:01:26 AM · Difficulty 10.6606 · 6,318,068 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ad7dbdf1e34e708284bf9c1cf0f95bfcee985b23c2c19e7678d0a76517267f1

Height

#488,935

Difficulty

10.660629

Transactions

7

Size

2.53 KB

Version

2

Bits

0aa91efe

Nonce

232,765,656

Timestamp

4/13/2014, 12:01:26 AM

Confirmations

6,318,068

Merkle Root

de104ebbd99b985851217f9f349b0cccc7891f978277beca40bbf10f6ab56a37
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.381 × 10⁹⁹(100-digit number)
23817210016918769475…28339261148626739201
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.381 × 10⁹⁹(100-digit number)
23817210016918769475…28339261148626739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.763 × 10⁹⁹(100-digit number)
47634420033837538950…56678522297253478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.526 × 10⁹⁹(100-digit number)
95268840067675077901…13357044594506956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.905 × 10¹⁰⁰(101-digit number)
19053768013535015580…26714089189013913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.810 × 10¹⁰⁰(101-digit number)
38107536027070031160…53428178378027827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.621 × 10¹⁰⁰(101-digit number)
76215072054140062320…06856356756055654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.524 × 10¹⁰¹(102-digit number)
15243014410828012464…13712713512111308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.048 × 10¹⁰¹(102-digit number)
30486028821656024928…27425427024222617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.097 × 10¹⁰¹(102-digit number)
60972057643312049856…54850854048445235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.219 × 10¹⁰²(103-digit number)
12194411528662409971…09701708096890470401
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,700,127 XPM·at block #6,807,002 · 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