Block #385,469

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2014, 7:35:20 PM · Difficulty 10.4058 · 6,421,593 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
073b98cbb9b09c816e994d71c0d5f6000a0ee7184c6f2b7906c19c9c2fd37fc5

Height

#385,469

Difficulty

10.405834

Transactions

2

Size

1.65 KB

Version

2

Bits

0a67e4c0

Nonce

46,533

Timestamp

2/1/2014, 7:35:20 PM

Confirmations

6,421,593

Merkle Root

c132eb31a7122a38c7c79b39ddeaee0d9b2f35d0c4ef5aa92f869e09cbe4c8ee
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.692 × 10⁹⁸(99-digit number)
16920425177330453091…31524709104924321201
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.692 × 10⁹⁸(99-digit number)
16920425177330453091…31524709104924321201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.384 × 10⁹⁸(99-digit number)
33840850354660906182…63049418209848642401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.768 × 10⁹⁸(99-digit number)
67681700709321812364…26098836419697284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.353 × 10⁹⁹(100-digit number)
13536340141864362472…52197672839394569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.707 × 10⁹⁹(100-digit number)
27072680283728724945…04395345678789139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.414 × 10⁹⁹(100-digit number)
54145360567457449891…08790691357578278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.082 × 10¹⁰⁰(101-digit number)
10829072113491489978…17581382715156556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.165 × 10¹⁰⁰(101-digit number)
21658144226982979956…35162765430313113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.331 × 10¹⁰⁰(101-digit number)
43316288453965959913…70325530860626227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.663 × 10¹⁰⁰(101-digit number)
86632576907931919826…40651061721252454401
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,700,593 XPM·at block #6,807,061 · 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