Block #346,560

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 3:17:09 PM · Difficulty 10.2288 · 6,470,115 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5fdfb56673b7104e8597fe7641f455d37240d628157673d0e30dbdab776c33f4

Height

#346,560

Difficulty

10.228831

Transactions

8

Size

3.33 KB

Version

2

Bits

0a3a94b1

Nonce

28,769

Timestamp

1/6/2014, 3:17:09 PM

Confirmations

6,470,115

Merkle Root

0551bc4f55b88ed487eb7c5a570cf52aad73b42e850b7a823b1be5793070f748
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.

5.428 × 10⁹⁸(99-digit number)
54289389432600065566…16497145130648646561
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
5.428 × 10⁹⁸(99-digit number)
54289389432600065566…16497145130648646561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.085 × 10⁹⁹(100-digit number)
10857877886520013113…32994290261297293121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.171 × 10⁹⁹(100-digit number)
21715755773040026226…65988580522594586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.343 × 10⁹⁹(100-digit number)
43431511546080052453…31977161045189172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.686 × 10⁹⁹(100-digit number)
86863023092160104906…63954322090378344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.737 × 10¹⁰⁰(101-digit number)
17372604618432020981…27908644180756689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.474 × 10¹⁰⁰(101-digit number)
34745209236864041962…55817288361513379841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.949 × 10¹⁰⁰(101-digit number)
69490418473728083924…11634576723026759681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.389 × 10¹⁰¹(102-digit number)
13898083694745616784…23269153446053519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.779 × 10¹⁰¹(102-digit number)
27796167389491233569…46538306892107038721
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,777,519 XPM·at block #6,816,674 · 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