Block #355,029

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 9:34:20 PM · Difficulty 10.3555 · 6,471,556 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
97dee681ac80b68981de3ef3af201708baf2b29ea5b75b9364416fb2cae6ac69

Height

#355,029

Difficulty

10.355483

Transactions

5

Size

1.66 KB

Version

2

Bits

0a5b00f0

Nonce

52,259

Timestamp

1/11/2014, 9:34:20 PM

Confirmations

6,471,556

Merkle Root

ac3c60122b0ee4a6286671640a75fd7266371ec5ea878978d8a38c78841541c9
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.

8.858 × 10⁹⁷(98-digit number)
88581300765971308043…15889350624806721851
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
8.858 × 10⁹⁷(98-digit number)
88581300765971308043…15889350624806721851
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.771 × 10⁹⁸(99-digit number)
17716260153194261608…31778701249613443701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.543 × 10⁹⁸(99-digit number)
35432520306388523217…63557402499226887401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.086 × 10⁹⁸(99-digit number)
70865040612777046434…27114804998453774801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.417 × 10⁹⁹(100-digit number)
14173008122555409286…54229609996907549601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.834 × 10⁹⁹(100-digit number)
28346016245110818573…08459219993815099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.669 × 10⁹⁹(100-digit number)
56692032490221637147…16918439987630198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.133 × 10¹⁰⁰(101-digit number)
11338406498044327429…33836879975260396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.267 × 10¹⁰⁰(101-digit number)
22676812996088654859…67673759950520793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.535 × 10¹⁰⁰(101-digit number)
45353625992177309718…35347519901041587201
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,856,830 XPM·at block #6,826,584 · 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