Block #385,652

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2014, 10:27:51 PM · Difficulty 10.4071 · 6,439,688 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a59208bc3c05bc0d376eea7a39b6d53c8360d76e1f520252f501d59baeed792b

Height

#385,652

Difficulty

10.407062

Transactions

5

Size

1.19 KB

Version

2

Bits

0a68353a

Nonce

1,220

Timestamp

2/1/2014, 10:27:51 PM

Confirmations

6,439,688

Merkle Root

f863fd601a729de7d46519409a63114f3252fd32ee9a23d9bc498f2d95712c00
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.

8.191 × 10⁹⁴(95-digit number)
81912735566824733628…40781150152550520021
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
8.191 × 10⁹⁴(95-digit number)
81912735566824733628…40781150152550520021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.638 × 10⁹⁵(96-digit number)
16382547113364946725…81562300305101040041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.276 × 10⁹⁵(96-digit number)
32765094226729893451…63124600610202080081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.553 × 10⁹⁵(96-digit number)
65530188453459786902…26249201220404160161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.310 × 10⁹⁶(97-digit number)
13106037690691957380…52498402440808320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.621 × 10⁹⁶(97-digit number)
26212075381383914761…04996804881616640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.242 × 10⁹⁶(97-digit number)
52424150762767829522…09993609763233281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10484830152553565904…19987219526466562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.096 × 10⁹⁷(98-digit number)
20969660305107131808…39974439052933125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.193 × 10⁹⁷(98-digit number)
41939320610214263617…79948878105866250241
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,846,825 XPM·at block #6,825,339 · 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