Block #356,949

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 1:58:03 AM · Difficulty 10.3842 · 6,468,179 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2a41ed6ca07c0a62a2c7b6fc9773a0da7c11ba22ab5ed9b6d73f22c670922bb7

Height

#356,949

Difficulty

10.384177

Transactions

8

Size

3.34 KB

Version

2

Bits

0a62596b

Nonce

10,213

Timestamp

1/13/2014, 1:58:03 AM

Confirmations

6,468,179

Merkle Root

6d7ee755f286b4644447515bb381190387c0f0e4aa0b0f95e2e2cac1fbeede72
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.

8.323 × 10⁹³(94-digit number)
83239155889314663483…83059615781987184641
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
8.323 × 10⁹³(94-digit number)
83239155889314663483…83059615781987184641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.664 × 10⁹⁴(95-digit number)
16647831177862932696…66119231563974369281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.329 × 10⁹⁴(95-digit number)
33295662355725865393…32238463127948738561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.659 × 10⁹⁴(95-digit number)
66591324711451730786…64476926255897477121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.331 × 10⁹⁵(96-digit number)
13318264942290346157…28953852511794954241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.663 × 10⁹⁵(96-digit number)
26636529884580692314…57907705023589908481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.327 × 10⁹⁵(96-digit number)
53273059769161384629…15815410047179816961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.065 × 10⁹⁶(97-digit number)
10654611953832276925…31630820094359633921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.130 × 10⁹⁶(97-digit number)
21309223907664553851…63261640188719267841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.261 × 10⁹⁶(97-digit number)
42618447815329107703…26523280377438535681
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,845,108 XPM·at block #6,825,127 · 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