Block #492,367

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 2:04:43 AM · Difficulty 10.6888 · 6,323,818 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70493b6f06d80b6fdc967380cc2dc523dd0edf11f8d157536ebf7890cdf6ab32

Height

#492,367

Difficulty

10.688793

Transactions

5

Size

1.09 KB

Version

2

Bits

0ab054b7

Nonce

639,433,590

Timestamp

4/15/2014, 2:04:43 AM

Confirmations

6,323,818

Merkle Root

8bd195803f0ae2d6ceea5d47b5e70446bcd3890af26c53aa1c4dddfbff41d341
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.

4.274 × 10⁹⁹(100-digit number)
42742961701162564007…65683921449224463361
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
4.274 × 10⁹⁹(100-digit number)
42742961701162564007…65683921449224463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.548 × 10⁹⁹(100-digit number)
85485923402325128014…31367842898448926721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.709 × 10¹⁰⁰(101-digit number)
17097184680465025602…62735685796897853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.419 × 10¹⁰⁰(101-digit number)
34194369360930051205…25471371593795706881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.838 × 10¹⁰⁰(101-digit number)
68388738721860102411…50942743187591413761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.367 × 10¹⁰¹(102-digit number)
13677747744372020482…01885486375182827521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.735 × 10¹⁰¹(102-digit number)
27355495488744040964…03770972750365655041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.471 × 10¹⁰¹(102-digit number)
54710990977488081929…07541945500731310081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.094 × 10¹⁰²(103-digit number)
10942198195497616385…15083891001462620161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.188 × 10¹⁰²(103-digit number)
21884396390995232771…30167782002925240321
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,606 XPM·at block #6,816,184 · 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