Block #274,494

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 7:46:27 AM · Difficulty 9.9577 · 6,536,355 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
08e994602d4be6f2445f6f2aae143fc2f74d59289711ab0b85d947bf251f1206

Height

#274,494

Difficulty

9.957650

Transactions

4

Size

1.76 KB

Version

2

Bits

09f5288d

Nonce

3,931

Timestamp

11/26/2013, 7:46:27 AM

Confirmations

6,536,355

Merkle Root

b8fe625f467c64a190a5d6bc88891c624c0eec2c179c4604dc07c2483ffe65af
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.235 × 10¹⁰⁴(105-digit number)
42357934329542725175…69768943723532281601
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.235 × 10¹⁰⁴(105-digit number)
42357934329542725175…69768943723532281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.471 × 10¹⁰⁴(105-digit number)
84715868659085450350…39537887447064563201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.694 × 10¹⁰⁵(106-digit number)
16943173731817090070…79075774894129126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.388 × 10¹⁰⁵(106-digit number)
33886347463634180140…58151549788258252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.777 × 10¹⁰⁵(106-digit number)
67772694927268360280…16303099576516505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.355 × 10¹⁰⁶(107-digit number)
13554538985453672056…32606199153033011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.710 × 10¹⁰⁶(107-digit number)
27109077970907344112…65212398306066022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.421 × 10¹⁰⁶(107-digit number)
54218155941814688224…30424796612132044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.084 × 10¹⁰⁷(108-digit number)
10843631188362937644…60849593224264089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.168 × 10¹⁰⁷(108-digit number)
21687262376725875289…21699186448528179201
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,730,888 XPM·at block #6,810,848 · 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