Block #2,645,624

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 11:59:18 PM · Difficulty 11.7358 · 4,186,134 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01911e7d8072951141276eac58968b86f0506639b30c003a832b8c89e7d2e217

Height

#2,645,624

Difficulty

11.735804

Transactions

4

Size

1.43 KB

Version

2

Bits

0bbc5da9

Nonce

307,498,097

Timestamp

5/2/2018, 11:59:18 PM

Confirmations

4,186,134

Merkle Root

3a040a409fe58cffbde8e3596577e2c06cd3cc83f5c48e7587636bd96f0275a3
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.

6.589 × 10⁹⁴(95-digit number)
65891640527447919167…60590579764251588399
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
6.589 × 10⁹⁴(95-digit number)
65891640527447919167…60590579764251588399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.317 × 10⁹⁵(96-digit number)
13178328105489583833…21181159528503176799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.635 × 10⁹⁵(96-digit number)
26356656210979167667…42362319057006353599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.271 × 10⁹⁵(96-digit number)
52713312421958335334…84724638114012707199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.054 × 10⁹⁶(97-digit number)
10542662484391667066…69449276228025414399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.108 × 10⁹⁶(97-digit number)
21085324968783334133…38898552456050828799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.217 × 10⁹⁶(97-digit number)
42170649937566668267…77797104912101657599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.434 × 10⁹⁶(97-digit number)
84341299875133336534…55594209824203315199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.686 × 10⁹⁷(98-digit number)
16868259975026667306…11188419648406630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.373 × 10⁹⁷(98-digit number)
33736519950053334613…22376839296813260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.747 × 10⁹⁷(98-digit number)
67473039900106669227…44753678593626521599
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,898,173 XPM·at block #6,831,757 · 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