Block #357,488

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 11:02:59 AM · Difficulty 10.3835 · 6,449,041 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7bfc94414c993c978c89f4720bac10ce523c1e1010bc3684502d636def86fb5

Height

#357,488

Difficulty

10.383493

Transactions

4

Size

890 B

Version

2

Bits

0a622c9f

Nonce

29,500

Timestamp

1/13/2014, 11:02:59 AM

Confirmations

6,449,041

Merkle Root

b3caa95ce1fb33e6a3bdb9a3a7b3f6e2e3eda16251dece7c511a879f30767925
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.531 × 10¹⁰⁶(107-digit number)
15318346725320452674…04740608171778291201
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.531 × 10¹⁰⁶(107-digit number)
15318346725320452674…04740608171778291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.063 × 10¹⁰⁶(107-digit number)
30636693450640905348…09481216343556582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.127 × 10¹⁰⁶(107-digit number)
61273386901281810697…18962432687113164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.225 × 10¹⁰⁷(108-digit number)
12254677380256362139…37924865374226329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.450 × 10¹⁰⁷(108-digit number)
24509354760512724278…75849730748452659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.901 × 10¹⁰⁷(108-digit number)
49018709521025448557…51699461496905318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.803 × 10¹⁰⁷(108-digit number)
98037419042050897115…03398922993810636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.960 × 10¹⁰⁸(109-digit number)
19607483808410179423…06797845987621273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.921 × 10¹⁰⁸(109-digit number)
39214967616820358846…13595691975242547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.842 × 10¹⁰⁸(109-digit number)
78429935233640717692…27191383950485094401
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,696,331 XPM·at block #6,806,528 · 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