Block #857,535

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 10:04:27 PM · Difficulty 10.9675 · 5,984,174 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ebec00c40e897b68cf0ad1ee90638d11923691ba8b4667599b328dd8a4db838

Height

#857,535

Difficulty

10.967483

Transactions

17

Size

3.74 KB

Version

2

Bits

0af7acf3

Nonce

1,434,243,219

Timestamp

12/17/2014, 10:04:27 PM

Confirmations

5,984,174

Merkle Root

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

2.533 × 10⁹⁴(95-digit number)
25331658637021900512…88141974572783257001
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
2.533 × 10⁹⁴(95-digit number)
25331658637021900512…88141974572783257001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.066 × 10⁹⁴(95-digit number)
50663317274043801025…76283949145566514001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.013 × 10⁹⁵(96-digit number)
10132663454808760205…52567898291133028001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.026 × 10⁹⁵(96-digit number)
20265326909617520410…05135796582266056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.053 × 10⁹⁵(96-digit number)
40530653819235040820…10271593164532112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.106 × 10⁹⁵(96-digit number)
81061307638470081641…20543186329064224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.621 × 10⁹⁶(97-digit number)
16212261527694016328…41086372658128448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.242 × 10⁹⁶(97-digit number)
32424523055388032656…82172745316256896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.484 × 10⁹⁶(97-digit number)
64849046110776065312…64345490632513792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.296 × 10⁹⁷(98-digit number)
12969809222155213062…28690981265027584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.593 × 10⁹⁷(98-digit number)
25939618444310426125…57381962530055168001
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,978,051 XPM·at block #6,841,708 · 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