Block #2,823,617

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2018, 12:55:17 AM · Difficulty 11.7065 · 4,008,252 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7648fbb4af08efb4848895760a5c1bb97d176d61705d3a16e1e2f230ae6d81ae

Height

#2,823,617

Difficulty

11.706540

Transactions

4

Size

1.29 KB

Version

2

Bits

0bb4dfd4

Nonce

97,984,975

Timestamp

9/4/2018, 12:55:17 AM

Confirmations

4,008,252

Merkle Root

1cced1a3a68be873262dddea9bed5f8bbff9609e841829dbe5d241f248f1bbc2
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.

3.457 × 10⁹⁶(97-digit number)
34575716043312066139…12400244055522136959
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
3.457 × 10⁹⁶(97-digit number)
34575716043312066139…12400244055522136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.915 × 10⁹⁶(97-digit number)
69151432086624132279…24800488111044273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.383 × 10⁹⁷(98-digit number)
13830286417324826455…49600976222088547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.766 × 10⁹⁷(98-digit number)
27660572834649652911…99201952444177095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.532 × 10⁹⁷(98-digit number)
55321145669299305823…98403904888354191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.106 × 10⁹⁸(99-digit number)
11064229133859861164…96807809776708382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.212 × 10⁹⁸(99-digit number)
22128458267719722329…93615619553416765439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.425 × 10⁹⁸(99-digit number)
44256916535439444658…87231239106833530879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.851 × 10⁹⁸(99-digit number)
88513833070878889317…74462478213667061759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.770 × 10⁹⁹(100-digit number)
17702766614175777863…48924956427334123519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.540 × 10⁹⁹(100-digit number)
35405533228351555726…97849912854668247039
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,899,074 XPM·at block #6,831,868 · 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