Block #636,255

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2014, 7:06:06 PM · Difficulty 10.9639 · 6,180,926 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5845a1b63f82e73940f7a979687cbbabe1ad6f9373f81f599916dd00a1aa812c

Height

#636,255

Difficulty

10.963872

Transactions

5

Size

1.38 KB

Version

2

Bits

0af6c053

Nonce

982,144,094

Timestamp

7/16/2014, 7:06:06 PM

Confirmations

6,180,926

Merkle Root

0faacac784be376c6f46807b72f18bbc00dbeb8262a3fa7d31dcedb1ea2a5a5c
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.280 × 10⁹⁹(100-digit number)
12803913590819524119…46807919822135217921
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.280 × 10⁹⁹(100-digit number)
12803913590819524119…46807919822135217921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.560 × 10⁹⁹(100-digit number)
25607827181639048239…93615839644270435841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.121 × 10⁹⁹(100-digit number)
51215654363278096478…87231679288540871681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.024 × 10¹⁰⁰(101-digit number)
10243130872655619295…74463358577081743361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.048 × 10¹⁰⁰(101-digit number)
20486261745311238591…48926717154163486721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.097 × 10¹⁰⁰(101-digit number)
40972523490622477182…97853434308326973441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.194 × 10¹⁰⁰(101-digit number)
81945046981244954365…95706868616653946881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.638 × 10¹⁰¹(102-digit number)
16389009396248990873…91413737233307893761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.277 × 10¹⁰¹(102-digit number)
32778018792497981746…82827474466615787521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.555 × 10¹⁰¹(102-digit number)
65556037584995963492…65654948933231575041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.311 × 10¹⁰²(103-digit number)
13111207516999192698…31309897866463150081
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,781,482 XPM·at block #6,817,180 · 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