Block #2,961,034

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2018, 7:31:30 AM · Difficulty 11.3468 · 3,878,677 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c9dd258ff4fe33b03819c44efe2c7e78a71179d74e4ed96334c67c412339787

Height

#2,961,034

Difficulty

11.346780

Transactions

40

Size

10.42 KB

Version

2

Bits

0b58c696

Nonce

223,029,019

Timestamp

12/11/2018, 7:31:30 AM

Confirmations

3,878,677

Merkle Root

a625802bb7d074308ffe8bbd0c98a0d31d82651080f34fe7652dcbcd8afb0ffe
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.

7.155 × 10⁹³(94-digit number)
71550876496978389786…24412639944208660799
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
7.155 × 10⁹³(94-digit number)
71550876496978389786…24412639944208660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.431 × 10⁹⁴(95-digit number)
14310175299395677957…48825279888417321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.862 × 10⁹⁴(95-digit number)
28620350598791355914…97650559776834643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.724 × 10⁹⁴(95-digit number)
57240701197582711829…95301119553669286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.144 × 10⁹⁵(96-digit number)
11448140239516542365…90602239107338572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.289 × 10⁹⁵(96-digit number)
22896280479033084731…81204478214677145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.579 × 10⁹⁵(96-digit number)
45792560958066169463…62408956429354291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.158 × 10⁹⁵(96-digit number)
91585121916132338926…24817912858708582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.831 × 10⁹⁶(97-digit number)
18317024383226467785…49635825717417164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.663 × 10⁹⁶(97-digit number)
36634048766452935570…99271651434834329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.326 × 10⁹⁶(97-digit number)
73268097532905871141…98543302869668659199
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,961,978 XPM·at block #6,839,710 · 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