Block #3,010,880

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2019, 3:41:32 PM · Difficulty 11.1986 · 3,805,985 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6f06bc5becbbeda05181bf25a6ec18176011c5aa8c6b9ec56a1775cd4712181

Height

#3,010,880

Difficulty

11.198576

Transactions

5

Size

1.93 KB

Version

2

Bits

0b32d5e7

Nonce

12,555,048

Timestamp

1/15/2019, 3:41:32 PM

Confirmations

3,805,985

Merkle Root

f1f7d924f12cafc2f99619270157c78fb8f732c8e90a0767fefa6143d67df71f
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.510 × 10⁹⁵(96-digit number)
35103839602183363390…36640145423996603919
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.510 × 10⁹⁵(96-digit number)
35103839602183363390…36640145423996603919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.020 × 10⁹⁵(96-digit number)
70207679204366726780…73280290847993207839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.404 × 10⁹⁶(97-digit number)
14041535840873345356…46560581695986415679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.808 × 10⁹⁶(97-digit number)
28083071681746690712…93121163391972831359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.616 × 10⁹⁶(97-digit number)
56166143363493381424…86242326783945662719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.123 × 10⁹⁷(98-digit number)
11233228672698676284…72484653567891325439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.246 × 10⁹⁷(98-digit number)
22466457345397352569…44969307135782650879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.493 × 10⁹⁷(98-digit number)
44932914690794705139…89938614271565301759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.986 × 10⁹⁷(98-digit number)
89865829381589410279…79877228543130603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.797 × 10⁹⁸(99-digit number)
17973165876317882055…59754457086261207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.594 × 10⁹⁸(99-digit number)
35946331752635764111…19508914172522414079
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,778,964 XPM·at block #6,816,864 · 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