Block #3,130,251

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2019, 11:47:57 AM · Difficulty 11.3105 · 3,711,100 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7f42ae839b4ea8666aff783ece61efb6bdd2a7678eb237586e1db6dd48c42ae9

Height

#3,130,251

Difficulty

11.310544

Transactions

29

Size

8.89 KB

Version

2

Bits

0b4f7fcd

Nonce

20,954,979

Timestamp

4/8/2019, 11:47:57 AM

Confirmations

3,711,100

Merkle Root

b04cda71fd9d4b26f475ad732f4b7497be4ff210af98e5a874eacfa2647405f6
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.226 × 10⁹³(94-digit number)
62262376294170286798…06286591032812831999
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.226 × 10⁹³(94-digit number)
62262376294170286798…06286591032812831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.245 × 10⁹⁴(95-digit number)
12452475258834057359…12573182065625663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.490 × 10⁹⁴(95-digit number)
24904950517668114719…25146364131251327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.980 × 10⁹⁴(95-digit number)
49809901035336229438…50292728262502655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.961 × 10⁹⁴(95-digit number)
99619802070672458876…00585456525005311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.992 × 10⁹⁵(96-digit number)
19923960414134491775…01170913050010623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.984 × 10⁹⁵(96-digit number)
39847920828268983550…02341826100021247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.969 × 10⁹⁵(96-digit number)
79695841656537967101…04683652200042495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.593 × 10⁹⁶(97-digit number)
15939168331307593420…09367304400084991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.187 × 10⁹⁶(97-digit number)
31878336662615186840…18734608800169983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.375 × 10⁹⁶(97-digit number)
63756673325230373681…37469217600339967999
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,975,175 XPM·at block #6,841,350 · 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