Block #2,996,904

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2019, 4:13:04 PM · Difficulty 11.2580 · 3,845,992 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
02df7501ffc240cc0d57dfdbb2d47dfa5c3314b8ab5ba538b3f36f907c46f6d4

Height

#2,996,904

Difficulty

11.258028

Transactions

33

Size

9.05 KB

Version

2

Bits

0b420e22

Nonce

41,557,505

Timestamp

1/5/2019, 4:13:04 PM

Confirmations

3,845,992

Merkle Root

213c8ca5d85e71d062ea7f578b822bfd8ebba3a24284033420dd53284a3530d9
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.230 × 10⁹³(94-digit number)
32301911057261648232…01937808716134508559
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.230 × 10⁹³(94-digit number)
32301911057261648232…01937808716134508559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.460 × 10⁹³(94-digit number)
64603822114523296464…03875617432269017119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.292 × 10⁹⁴(95-digit number)
12920764422904659292…07751234864538034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.584 × 10⁹⁴(95-digit number)
25841528845809318585…15502469729076068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.168 × 10⁹⁴(95-digit number)
51683057691618637171…31004939458152136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.033 × 10⁹⁵(96-digit number)
10336611538323727434…62009878916304273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.067 × 10⁹⁵(96-digit number)
20673223076647454868…24019757832608547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.134 × 10⁹⁵(96-digit number)
41346446153294909737…48039515665217095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.269 × 10⁹⁵(96-digit number)
82692892306589819474…96079031330434191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.653 × 10⁹⁶(97-digit number)
16538578461317963894…92158062660868382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.307 × 10⁹⁶(97-digit number)
33077156922635927789…84316125321736765439
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,987,516 XPM·at block #6,842,895 · 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