Block #439,056

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 10:26:30 AM · Difficulty 10.3585 · 6,369,423 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
07a20c1876ccad33d86e7a7d4a6851b4a849c5baa38778aba0ba5f756dfaf338

Height

#439,056

Difficulty

10.358511

Transactions

2

Size

582 B

Version

2

Bits

0a5bc75d

Nonce

16,700

Timestamp

3/11/2014, 10:26:30 AM

Confirmations

6,369,423

Merkle Root

4128bb4c7591b6145180b0d86705d304abad74395033c43579ca87487c2a5d85
Transactions (2)
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.225 × 10⁹⁹(100-digit number)
92255341569847457888…16061581662173998081
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.225 × 10⁹⁹(100-digit number)
92255341569847457888…16061581662173998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.845 × 10¹⁰⁰(101-digit number)
18451068313969491577…32123163324347996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.690 × 10¹⁰⁰(101-digit number)
36902136627938983155…64246326648695992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.380 × 10¹⁰⁰(101-digit number)
73804273255877966310…28492653297391984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.476 × 10¹⁰¹(102-digit number)
14760854651175593262…56985306594783969281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.952 × 10¹⁰¹(102-digit number)
29521709302351186524…13970613189567938561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.904 × 10¹⁰¹(102-digit number)
59043418604702373048…27941226379135877121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.180 × 10¹⁰²(103-digit number)
11808683720940474609…55882452758271754241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.361 × 10¹⁰²(103-digit number)
23617367441880949219…11764905516543508481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.723 × 10¹⁰²(103-digit number)
47234734883761898438…23529811033087016961
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,711,882 XPM·at block #6,808,478 · 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