Block #351,478

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2014, 5:46:28 PM · Difficulty 10.2956 · 6,475,925 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0706ecd7b5fc461f06d87377b74a51c36a81d13ffbbbb8b7b8f7f9bde31663b9

Height

#351,478

Difficulty

10.295597

Transactions

8

Size

2.42 KB

Version

2

Bits

0a4bac42

Nonce

133,239

Timestamp

1/9/2014, 5:46:28 PM

Confirmations

6,475,925

Merkle Root

8457c370bd3cb8865c303d71cd782837a13176737b4830df693fa59f3d96ea35
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.171 × 10¹⁰⁰(101-digit number)
11718796202869084256…97571519438576414721
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.171 × 10¹⁰⁰(101-digit number)
11718796202869084256…97571519438576414721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.343 × 10¹⁰⁰(101-digit number)
23437592405738168512…95143038877152829441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.687 × 10¹⁰⁰(101-digit number)
46875184811476337025…90286077754305658881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.375 × 10¹⁰⁰(101-digit number)
93750369622952674051…80572155508611317761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.875 × 10¹⁰¹(102-digit number)
18750073924590534810…61144311017222635521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.750 × 10¹⁰¹(102-digit number)
37500147849181069620…22288622034445271041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.500 × 10¹⁰¹(102-digit number)
75000295698362139241…44577244068890542081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.500 × 10¹⁰²(103-digit number)
15000059139672427848…89154488137781084161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.000 × 10¹⁰²(103-digit number)
30000118279344855696…78308976275562168321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.000 × 10¹⁰²(103-digit number)
60000236558689711393…56617952551124336641
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,863,329 XPM·at block #6,827,402 · 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