Block #3,431,266

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2019, 9:06:18 AM · Difficulty 10.9804 · 3,394,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
e0577c261cab45d1881dda2c21d98095a3d306bf95291b4e732aa4ff16f43b4a

Height

#3,431,266

Difficulty

10.980387

Transactions

24

Size

5.66 KB

Version

2

Bits

0afafaa1

Nonce

955,107,224

Timestamp

11/13/2019, 9:06:18 AM

Confirmations

3,394,100

Merkle Root

6b82ea648385896abee2913c830541477bebf840f5a12aafb675267bcc48043a
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.013 × 10⁹⁴(95-digit number)
70137751459521890108…62248279034352802559
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.013 × 10⁹⁴(95-digit number)
70137751459521890108…62248279034352802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.402 × 10⁹⁵(96-digit number)
14027550291904378021…24496558068705605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.805 × 10⁹⁵(96-digit number)
28055100583808756043…48993116137411210239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.611 × 10⁹⁵(96-digit number)
56110201167617512086…97986232274822420479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.122 × 10⁹⁶(97-digit number)
11222040233523502417…95972464549644840959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.244 × 10⁹⁶(97-digit number)
22444080467047004834…91944929099289681919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.488 × 10⁹⁶(97-digit number)
44888160934094009669…83889858198579363839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.977 × 10⁹⁶(97-digit number)
89776321868188019339…67779716397158727679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.795 × 10⁹⁷(98-digit number)
17955264373637603867…35559432794317455359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.591 × 10⁹⁷(98-digit number)
35910528747275207735…71118865588634910719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.182 × 10⁹⁷(98-digit number)
71821057494550415471…42237731177269821439
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,847,024 XPM·at block #6,825,365 · 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