Block #358,212

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 10:07:08 PM · Difficulty 10.3910 · 6,452,635 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
39de279e320bb77530f73308c784ebe91c65cea8cdad449183c7445bf8d5a5f9

Height

#358,212

Difficulty

10.390967

Transactions

11

Size

3.89 KB

Version

2

Bits

0a64166a

Nonce

112,005

Timestamp

1/13/2014, 10:07:08 PM

Confirmations

6,452,635

Merkle Root

1ccafc968fa677574572ea4904cd9ffdd5f359208a8777cfe839b5f52f2e114c
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.

1.168 × 10⁹⁰(91-digit number)
11680893643300053739…03911315903344466641
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
1.168 × 10⁹⁰(91-digit number)
11680893643300053739…03911315903344466641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.336 × 10⁹⁰(91-digit number)
23361787286600107478…07822631806688933281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.672 × 10⁹⁰(91-digit number)
46723574573200214956…15645263613377866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.344 × 10⁹⁰(91-digit number)
93447149146400429913…31290527226755733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.868 × 10⁹¹(92-digit number)
18689429829280085982…62581054453511466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.737 × 10⁹¹(92-digit number)
37378859658560171965…25162108907022932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.475 × 10⁹¹(92-digit number)
74757719317120343930…50324217814045864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.495 × 10⁹²(93-digit number)
14951543863424068786…00648435628091729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.990 × 10⁹²(93-digit number)
29903087726848137572…01296871256183459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.980 × 10⁹²(93-digit number)
59806175453696275144…02593742512366919681
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,872 XPM·at block #6,810,846 · 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