Block #3,356,448

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/15/2019, 10:08:10 PM · Difficulty 10.9960 · 3,470,390 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d8d085d36bb05274bf3fa1583350724a2b6bc79ccd94d2e1c8227bbc4b30cb80

Height

#3,356,448

Difficulty

10.996000

Transactions

9

Size

2.38 KB

Version

2

Bits

0afef9d3

Nonce

112,946,043

Timestamp

9/15/2019, 10:08:10 PM

Confirmations

3,470,390

Merkle Root

4f6941bed6e9fe424fe639853e1db246c18739fd6f56eb71ca00d648d44ef316
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.799 × 10⁹⁴(95-digit number)
57990073474781347531…81919201053178050239
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.799 × 10⁹⁴(95-digit number)
57990073474781347531…81919201053178050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.159 × 10⁹⁵(96-digit number)
11598014694956269506…63838402106356100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.319 × 10⁹⁵(96-digit number)
23196029389912539012…27676804212712200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.639 × 10⁹⁵(96-digit number)
46392058779825078025…55353608425424401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.278 × 10⁹⁵(96-digit number)
92784117559650156050…10707216850848803839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.855 × 10⁹⁶(97-digit number)
18556823511930031210…21414433701697607679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.711 × 10⁹⁶(97-digit number)
37113647023860062420…42828867403395215359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.422 × 10⁹⁶(97-digit number)
74227294047720124840…85657734806790430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.484 × 10⁹⁷(98-digit number)
14845458809544024968…71315469613580861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.969 × 10⁹⁷(98-digit number)
29690917619088049936…42630939227161722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.938 × 10⁹⁷(98-digit number)
59381835238176099872…85261878454323445759
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,858,871 XPM·at block #6,826,837 · 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