Block #343,907

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 11:34:21 PM · Difficulty 10.1856 · 6,468,835 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da5d574a9f6f98ecb4d8720d100ae398ed1fc86cfaf7118b2ef859f75e77aea2

Height

#343,907

Difficulty

10.185580

Transactions

4

Size

1.16 KB

Version

2

Bits

0a2f822c

Nonce

87,711

Timestamp

1/4/2014, 11:34:21 PM

Confirmations

6,468,835

Merkle Root

bebbc1a904f6646b4aa255850c54c62e73a110168f233836fdc1370bc4b93437
Transactions (4)
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.012 × 10¹⁰⁰(101-digit number)
20126091118184771160…85546413944896490241
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.012 × 10¹⁰⁰(101-digit number)
20126091118184771160…85546413944896490241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.025 × 10¹⁰⁰(101-digit number)
40252182236369542320…71092827889792980481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.050 × 10¹⁰⁰(101-digit number)
80504364472739084641…42185655779585960961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.610 × 10¹⁰¹(102-digit number)
16100872894547816928…84371311559171921921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.220 × 10¹⁰¹(102-digit number)
32201745789095633856…68742623118343843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.440 × 10¹⁰¹(102-digit number)
64403491578191267713…37485246236687687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.288 × 10¹⁰²(103-digit number)
12880698315638253542…74970492473375375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.576 × 10¹⁰²(103-digit number)
25761396631276507085…49940984946750750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.152 × 10¹⁰²(103-digit number)
51522793262553014170…99881969893501501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.030 × 10¹⁰³(104-digit number)
10304558652510602834…99763939787003002881
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,745,979 XPM·at block #6,812,741 · 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