Block #356,226

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2014, 3:17:23 PM · Difficulty 10.3737 · 6,449,623 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0375badefa228e643df737fda3ec0a720bf3e54c7fef71ec52b0436234ebaed7

Height

#356,226

Difficulty

10.373719

Transactions

2

Size

575 B

Version

2

Bits

0a5fac07

Nonce

148,263

Timestamp

1/12/2014, 3:17:23 PM

Confirmations

6,449,623

Merkle Root

72727c120748e0a70fc16c6b7738f4fba178fcd7c83f16008e0be29f64596d3e
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.

3.527 × 10¹⁰⁰(101-digit number)
35279784372641634837…57466693798979571441
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
3.527 × 10¹⁰⁰(101-digit number)
35279784372641634837…57466693798979571441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.055 × 10¹⁰⁰(101-digit number)
70559568745283269674…14933387597959142881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.411 × 10¹⁰¹(102-digit number)
14111913749056653934…29866775195918285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.822 × 10¹⁰¹(102-digit number)
28223827498113307869…59733550391836571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.644 × 10¹⁰¹(102-digit number)
56447654996226615739…19467100783673143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.128 × 10¹⁰²(103-digit number)
11289530999245323147…38934201567346286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.257 × 10¹⁰²(103-digit number)
22579061998490646295…77868403134692572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.515 × 10¹⁰²(103-digit number)
45158123996981292591…55736806269385144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.031 × 10¹⁰²(103-digit number)
90316247993962585183…11473612538770288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.806 × 10¹⁰³(104-digit number)
18063249598792517036…22947225077540577281
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,690,872 XPM·at block #6,805,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.