Block #440,767

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 3:55:27 PM · Difficulty 10.3528 · 6,366,570 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd7ab0f6a41e3d722b1e089965ac7684c2ebf5e7a86c8d158d669e1c6a5d43ec

Height

#440,767

Difficulty

10.352766

Transactions

1

Size

836 B

Version

2

Bits

0a5a4ee4

Nonce

145,149

Timestamp

3/12/2014, 3:55:27 PM

Confirmations

6,366,570

Merkle Root

25c7d2220c88cd414f3232e1bafa03f2833273845c52eb6fe20fbeb08d469a99
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.616 × 10¹⁰¹(102-digit number)
16160331248377670984…20615284836053198401
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.616 × 10¹⁰¹(102-digit number)
16160331248377670984…20615284836053198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.232 × 10¹⁰¹(102-digit number)
32320662496755341968…41230569672106396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.464 × 10¹⁰¹(102-digit number)
64641324993510683937…82461139344212793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.292 × 10¹⁰²(103-digit number)
12928264998702136787…64922278688425587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.585 × 10¹⁰²(103-digit number)
25856529997404273574…29844557376851174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.171 × 10¹⁰²(103-digit number)
51713059994808547149…59689114753702348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.034 × 10¹⁰³(104-digit number)
10342611998961709429…19378229507404697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.068 × 10¹⁰³(104-digit number)
20685223997923418859…38756459014809395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.137 × 10¹⁰³(104-digit number)
41370447995846837719…77512918029618790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.274 × 10¹⁰³(104-digit number)
82740895991693675439…55025836059237580801
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,702,714 XPM·at block #6,807,336 · 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