Block #386,302

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/2/2014, 9:20:52 AM · Difficulty 10.4068 · 6,428,642 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e40103f0e77d09f542e4d473afeca8e169a98793c91ba9c69967fee76f7a0e82

Height

#386,302

Difficulty

10.406839

Transactions

10

Size

2.19 KB

Version

2

Bits

0a682695

Nonce

2,844

Timestamp

2/2/2014, 9:20:52 AM

Confirmations

6,428,642

Merkle Root

1dece7078d8e60dcf1ff2ac75e4477332e417371e802b7f70544c7b9b6a7b614
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.452 × 10⁹⁵(96-digit number)
14520464133245342350…20025069707738414401
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.452 × 10⁹⁵(96-digit number)
14520464133245342350…20025069707738414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.904 × 10⁹⁵(96-digit number)
29040928266490684700…40050139415476828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.808 × 10⁹⁵(96-digit number)
58081856532981369400…80100278830953657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.161 × 10⁹⁶(97-digit number)
11616371306596273880…60200557661907315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.323 × 10⁹⁶(97-digit number)
23232742613192547760…20401115323814630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.646 × 10⁹⁶(97-digit number)
46465485226385095520…40802230647629260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.293 × 10⁹⁶(97-digit number)
92930970452770191041…81604461295258521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.858 × 10⁹⁷(98-digit number)
18586194090554038208…63208922590517043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.717 × 10⁹⁷(98-digit number)
37172388181108076416…26417845181034086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.434 × 10⁹⁷(98-digit number)
74344776362216152833…52835690362068172801
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,763,648 XPM·at block #6,814,943 · 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