Block #2,632,812

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 1:43:58 AM · Difficulty 11.1780 · 4,209,383 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ae7836bfc736d49f36d3a6727177d4111bd0ad60be254f4e066f7a48bac335c

Height

#2,632,812

Difficulty

11.177978

Transactions

72

Size

19.53 KB

Version

2

Bits

0b2d8ff0

Nonce

352,977,934

Timestamp

4/28/2018, 1:43:58 AM

Confirmations

4,209,383

Merkle Root

92d90c78d69d71433be36ae8afa5d8f1e4a1c496c6260702976fe94da770122f
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.097 × 10⁹⁴(95-digit number)
20973958791293387113…20243138359899062239
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.097 × 10⁹⁴(95-digit number)
20973958791293387113…20243138359899062239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.194 × 10⁹⁴(95-digit number)
41947917582586774227…40486276719798124479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.389 × 10⁹⁴(95-digit number)
83895835165173548455…80972553439596248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.677 × 10⁹⁵(96-digit number)
16779167033034709691…61945106879192497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.355 × 10⁹⁵(96-digit number)
33558334066069419382…23890213758384995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.711 × 10⁹⁵(96-digit number)
67116668132138838764…47780427516769991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.342 × 10⁹⁶(97-digit number)
13423333626427767752…95560855033539983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.684 × 10⁹⁶(97-digit number)
26846667252855535505…91121710067079966719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.369 × 10⁹⁶(97-digit number)
53693334505711071011…82243420134159933439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.073 × 10⁹⁷(98-digit number)
10738666901142214202…64486840268319866879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.147 × 10⁹⁷(98-digit number)
21477333802284428404…28973680536639733759
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,981,953 XPM·at block #6,842,194 · 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