Block #2,576,247

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2018, 5:48:40 PM · Difficulty 10.9957 · 4,262,641 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
73f562b17eebae3c85e4e5b29b082b43422f2ca894bf33599c0c97815428b419

Height

#2,576,247

Difficulty

10.995676

Transactions

5

Size

4.99 KB

Version

2

Bits

0afee4a6

Nonce

1,673,025,120

Timestamp

3/20/2018, 5:48:40 PM

Confirmations

4,262,641

Merkle Root

ac84d83008526b803e08c066831c5f91de47944707cb5d97e8afb1a41d7aac6a
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.935 × 10⁹⁷(98-digit number)
69357920519357466161…71428943294007654399
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.935 × 10⁹⁷(98-digit number)
69357920519357466161…71428943294007654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.387 × 10⁹⁸(99-digit number)
13871584103871493232…42857886588015308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.774 × 10⁹⁸(99-digit number)
27743168207742986464…85715773176030617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.548 × 10⁹⁸(99-digit number)
55486336415485972929…71431546352061235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.109 × 10⁹⁹(100-digit number)
11097267283097194585…42863092704122470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.219 × 10⁹⁹(100-digit number)
22194534566194389171…85726185408244940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.438 × 10⁹⁹(100-digit number)
44389069132388778343…71452370816489881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.877 × 10⁹⁹(100-digit number)
88778138264777556687…42904741632979763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.775 × 10¹⁰⁰(101-digit number)
17755627652955511337…85809483265959526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.551 × 10¹⁰⁰(101-digit number)
35511255305911022674…71618966531919052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.102 × 10¹⁰⁰(101-digit number)
71022510611822045349…43237933063838105599
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,955,373 XPM·at block #6,838,887 · 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