Block #2,996,262

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2019, 5:06:25 AM · Difficulty 11.2614 · 3,834,235 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e39da483f02d998a7227d8233adfa44d685202d7e3e5bc931e167aeb0e3c19fc

Height

#2,996,262

Difficulty

11.261414

Transactions

2

Size

1.14 KB

Version

2

Bits

0b42ec03

Nonce

1,097,131,744

Timestamp

1/5/2019, 5:06:25 AM

Confirmations

3,834,235

Merkle Root

ecfaeead57bf27ecd13b826832108d4391dfc0c69388e9e4bf1a05c03576b3af
Transactions (2)
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.565 × 10⁹³(94-digit number)
65659199559866231667…13104360643189367039
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.565 × 10⁹³(94-digit number)
65659199559866231667…13104360643189367039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.313 × 10⁹⁴(95-digit number)
13131839911973246333…26208721286378734079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.626 × 10⁹⁴(95-digit number)
26263679823946492667…52417442572757468159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.252 × 10⁹⁴(95-digit number)
52527359647892985334…04834885145514936319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.050 × 10⁹⁵(96-digit number)
10505471929578597066…09669770291029872639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.101 × 10⁹⁵(96-digit number)
21010943859157194133…19339540582059745279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.202 × 10⁹⁵(96-digit number)
42021887718314388267…38679081164119490559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.404 × 10⁹⁵(96-digit number)
84043775436628776534…77358162328238981119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.680 × 10⁹⁶(97-digit number)
16808755087325755306…54716324656477962239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.361 × 10⁹⁶(97-digit number)
33617510174651510613…09432649312955924479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.723 × 10⁹⁶(97-digit number)
67235020349303021227…18865298625911848959
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,888,225 XPM·at block #6,830,496 · 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