Block #3,494,000

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/30/2019, 12:14:00 PM · Difficulty 10.9501 · 3,348,432 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
93e035f09488f3bc5a772540261209a7665696aa44350506503f93260eba7cbd

Height

#3,494,000

Difficulty

10.950117

Transactions

7

Size

2.65 KB

Version

2

Bits

0af33ae4

Nonce

1,720,376,090

Timestamp

12/30/2019, 12:14:00 PM

Confirmations

3,348,432

Merkle Root

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

1.690 × 10⁹⁴(95-digit number)
16901708477143267639…99813234634230344159
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
1.690 × 10⁹⁴(95-digit number)
16901708477143267639…99813234634230344159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.380 × 10⁹⁴(95-digit number)
33803416954286535278…99626469268460688319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.760 × 10⁹⁴(95-digit number)
67606833908573070556…99252938536921376639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.352 × 10⁹⁵(96-digit number)
13521366781714614111…98505877073842753279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.704 × 10⁹⁵(96-digit number)
27042733563429228222…97011754147685506559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.408 × 10⁹⁵(96-digit number)
54085467126858456445…94023508295371013119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.081 × 10⁹⁶(97-digit number)
10817093425371691289…88047016590742026239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.163 × 10⁹⁶(97-digit number)
21634186850743382578…76094033181484052479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.326 × 10⁹⁶(97-digit number)
43268373701486765156…52188066362968104959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.653 × 10⁹⁶(97-digit number)
86536747402973530312…04376132725936209919
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,983,871 XPM·at block #6,842,431 · 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