Block #429,076

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 1:05:58 PM · Difficulty 10.3459 · 6,379,157 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
95565ac7036fafb3be0288d958a5c036d00f4c543ba09610f4213b4432b11518

Height

#429,076

Difficulty

10.345876

Transactions

5

Size

2.39 KB

Version

2

Bits

0a588b4d

Nonce

326,883

Timestamp

3/4/2014, 1:05:58 PM

Confirmations

6,379,157

Merkle Root

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

9.291 × 10⁹⁸(99-digit number)
92911575373097005180…54314320061429250801
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
9.291 × 10⁹⁸(99-digit number)
92911575373097005180…54314320061429250801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.858 × 10⁹⁹(100-digit number)
18582315074619401036…08628640122858501601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.716 × 10⁹⁹(100-digit number)
37164630149238802072…17257280245717003201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.432 × 10⁹⁹(100-digit number)
74329260298477604144…34514560491434006401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.486 × 10¹⁰⁰(101-digit number)
14865852059695520828…69029120982868012801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.973 × 10¹⁰⁰(101-digit number)
29731704119391041657…38058241965736025601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.946 × 10¹⁰⁰(101-digit number)
59463408238782083315…76116483931472051201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.189 × 10¹⁰¹(102-digit number)
11892681647756416663…52232967862944102401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.378 × 10¹⁰¹(102-digit number)
23785363295512833326…04465935725888204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.757 × 10¹⁰¹(102-digit number)
47570726591025666652…08931871451776409601
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,709,917 XPM·at block #6,808,232 · 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