Block #436,742

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2014, 7:31:53 PM · Difficulty 10.3600 · 6,390,369 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e75df831de8a97c89026c45b3915bc6c9702714aa04e4b6a63eccc2dd5ecdcab

Height

#436,742

Difficulty

10.359998

Transactions

4

Size

1.57 KB

Version

2

Bits

0a5c28d4

Nonce

5,146

Timestamp

3/9/2014, 7:31:53 PM

Confirmations

6,390,369

Merkle Root

5793c164b60ec875eed7c55d2870ce5b6fb3bd639cb0a261263613581af16fa9
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.027 × 10⁹⁵(96-digit number)
10279438909976858888…97577178005805796241
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.027 × 10⁹⁵(96-digit number)
10279438909976858888…97577178005805796241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.055 × 10⁹⁵(96-digit number)
20558877819953717777…95154356011611592481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.111 × 10⁹⁵(96-digit number)
41117755639907435554…90308712023223184961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.223 × 10⁹⁵(96-digit number)
82235511279814871108…80617424046446369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.644 × 10⁹⁶(97-digit number)
16447102255962974221…61234848092892739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.289 × 10⁹⁶(97-digit number)
32894204511925948443…22469696185785479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.578 × 10⁹⁶(97-digit number)
65788409023851896886…44939392371570959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.315 × 10⁹⁷(98-digit number)
13157681804770379377…89878784743141918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.631 × 10⁹⁷(98-digit number)
26315363609540758754…79757569486283837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.263 × 10⁹⁷(98-digit number)
52630727219081517509…59515138972567674881
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,861,067 XPM·at block #6,827,110 · 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