Block #350,929

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2014, 9:16:25 AM · Difficulty 10.2900 · 6,459,122 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
38f92b1d854fbcf6039a36fb11de0c098fae0a0c776dd96a4601412fac573139

Height

#350,929

Difficulty

10.289950

Transactions

12

Size

3.59 KB

Version

2

Bits

0a4a3a30

Nonce

67,073

Timestamp

1/9/2014, 9:16:25 AM

Confirmations

6,459,122

Merkle Root

33ff123e5f66ef47670c4525bf425cc6961893731c8fc6e5dad78757a6f30778
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.

6.204 × 10⁹⁷(98-digit number)
62042798312175943960…67319160314835072001
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
6.204 × 10⁹⁷(98-digit number)
62042798312175943960…67319160314835072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.240 × 10⁹⁸(99-digit number)
12408559662435188792…34638320629670144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.481 × 10⁹⁸(99-digit number)
24817119324870377584…69276641259340288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.963 × 10⁹⁸(99-digit number)
49634238649740755168…38553282518680576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.926 × 10⁹⁸(99-digit number)
99268477299481510337…77106565037361152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.985 × 10⁹⁹(100-digit number)
19853695459896302067…54213130074722304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.970 × 10⁹⁹(100-digit number)
39707390919792604134…08426260149444608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.941 × 10⁹⁹(100-digit number)
79414781839585208269…16852520298889216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.588 × 10¹⁰⁰(101-digit number)
15882956367917041653…33705040597778432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.176 × 10¹⁰⁰(101-digit number)
31765912735834083307…67410081195556864001
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,724,481 XPM·at block #6,810,050 · 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