Block #843,785

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 3:56:27 PM · Difficulty 10.9730 · 5,982,863 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a752773d4a841d121e7d62c3abdc2a11077c7f7e6be0a67bdee1fad43dc32f66

Height

#843,785

Difficulty

10.973034

Transactions

6

Size

1.31 KB

Version

2

Bits

0af918c5

Nonce

2,359,437,396

Timestamp

12/7/2014, 3:56:27 PM

Confirmations

5,982,863

Merkle Root

1f5c30730745ce419bbb361bf58de2efb7f6330047ed2d522da47c269c54a4b8
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.

5.653 × 10⁹⁵(96-digit number)
56531084092894213224…47354478521088172561
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
5.653 × 10⁹⁵(96-digit number)
56531084092894213224…47354478521088172561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.130 × 10⁹⁶(97-digit number)
11306216818578842644…94708957042176345121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.261 × 10⁹⁶(97-digit number)
22612433637157685289…89417914084352690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.522 × 10⁹⁶(97-digit number)
45224867274315370579…78835828168705380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.044 × 10⁹⁶(97-digit number)
90449734548630741159…57671656337410760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.808 × 10⁹⁷(98-digit number)
18089946909726148231…15343312674821521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.617 × 10⁹⁷(98-digit number)
36179893819452296463…30686625349643043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.235 × 10⁹⁷(98-digit number)
72359787638904592927…61373250699286087681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.447 × 10⁹⁸(99-digit number)
14471957527780918585…22746501398572175361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.894 × 10⁹⁸(99-digit number)
28943915055561837170…45493002797144350721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.788 × 10⁹⁸(99-digit number)
57887830111123674341…90986005594288701441
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,857,332 XPM·at block #6,826,647 · 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