Block #456,776

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 11:08:46 AM · Difficulty 10.4177 · 6,368,033 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
01ac7efabb64ed5d182e321043310d4fd4abfc1df3c9e3d2758023cc548f6727

Height

#456,776

Difficulty

10.417655

Transactions

3

Size

654 B

Version

2

Bits

0a6aeb6f

Nonce

241,721

Timestamp

3/23/2014, 11:08:46 AM

Confirmations

6,368,033

Merkle Root

48edcaafc522fa967d332a56346744d6461ec37fca14995e8117dee089ae40d8
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.142 × 10⁹⁹(100-digit number)
11429969534494905126…86663510875975971841
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.142 × 10⁹⁹(100-digit number)
11429969534494905126…86663510875975971841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.285 × 10⁹⁹(100-digit number)
22859939068989810253…73327021751951943681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.571 × 10⁹⁹(100-digit number)
45719878137979620507…46654043503903887361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.143 × 10⁹⁹(100-digit number)
91439756275959241014…93308087007807774721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.828 × 10¹⁰⁰(101-digit number)
18287951255191848202…86616174015615549441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.657 × 10¹⁰⁰(101-digit number)
36575902510383696405…73232348031231098881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.315 × 10¹⁰⁰(101-digit number)
73151805020767392811…46464696062462197761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.463 × 10¹⁰¹(102-digit number)
14630361004153478562…92929392124924395521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.926 × 10¹⁰¹(102-digit number)
29260722008306957124…85858784249848791041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.852 × 10¹⁰¹(102-digit number)
58521444016613914249…71717568499697582081
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,842,548 XPM·at block #6,824,808 · 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