Block #857,040

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 1:19:12 PM · Difficulty 10.9676 · 5,985,286 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3006744abbba74f9b8e70de6e873e088de70928779c5da20061ab7e9a385f1b2

Height

#857,040

Difficulty

10.967648

Transactions

4

Size

918 B

Version

2

Bits

0af7b7c6

Nonce

595,579,348

Timestamp

12/17/2014, 1:19:12 PM

Confirmations

5,985,286

Merkle Root

a4eb985c54951217cbe636a1a0f95ec574fe3d54f2b91aec6f99829c3cc9046f
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.792 × 10⁹⁵(96-digit number)
17923995387373381384…18579111328638114401
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.792 × 10⁹⁵(96-digit number)
17923995387373381384…18579111328638114401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.584 × 10⁹⁵(96-digit number)
35847990774746762769…37158222657276228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.169 × 10⁹⁵(96-digit number)
71695981549493525539…74316445314552457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.433 × 10⁹⁶(97-digit number)
14339196309898705107…48632890629104915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.867 × 10⁹⁶(97-digit number)
28678392619797410215…97265781258209830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.735 × 10⁹⁶(97-digit number)
57356785239594820431…94531562516419660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.147 × 10⁹⁷(98-digit number)
11471357047918964086…89063125032839321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.294 × 10⁹⁷(98-digit number)
22942714095837928172…78126250065678643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.588 × 10⁹⁷(98-digit number)
45885428191675856345…56252500131357286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.177 × 10⁹⁷(98-digit number)
91770856383351712690…12505000262714572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.835 × 10⁹⁸(99-digit number)
18354171276670342538…25010000525429145601
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,983,015 XPM·at block #6,842,325 · 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