Block #3,509,768

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2020, 4:45:52 PM · Difficulty 10.9294 · 3,317,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
93623e462491ec958d7d2be33c33ff18a5edb872e1797016ce92232448950a07

Height

#3,509,768

Difficulty

10.929445

Transactions

15

Size

3.88 KB

Version

2

Bits

0aedf019

Nonce

82,577,860

Timestamp

1/11/2020, 4:45:52 PM

Confirmations

3,317,541

Merkle Root

03c84229b819be6a9e3f0bf00146f917a06ca7c48bb96686f27f11ff8097f286
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.

5.308 × 10⁹⁴(95-digit number)
53085605726649991292…02752436002164537119
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
5.308 × 10⁹⁴(95-digit number)
53085605726649991292…02752436002164537119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.061 × 10⁹⁵(96-digit number)
10617121145329998258…05504872004329074239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.123 × 10⁹⁵(96-digit number)
21234242290659996516…11009744008658148479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.246 × 10⁹⁵(96-digit number)
42468484581319993033…22019488017316296959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.493 × 10⁹⁵(96-digit number)
84936969162639986067…44038976034632593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.698 × 10⁹⁶(97-digit number)
16987393832527997213…88077952069265187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.397 × 10⁹⁶(97-digit number)
33974787665055994427…76155904138530375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.794 × 10⁹⁶(97-digit number)
67949575330111988854…52311808277060751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.358 × 10⁹⁷(98-digit number)
13589915066022397770…04623616554121502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.717 × 10⁹⁷(98-digit number)
27179830132044795541…09247233108243005439
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,862,584 XPM·at block #6,827,308 · 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