Block #3,505,572

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2020, 5:39:39 PM · Difficulty 10.9303 · 3,337,521 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e4f2a583d84c9248f7223b4fb0021190a76d18a96f03f7b1659ea1340ec97400

Height

#3,505,572

Difficulty

10.930316

Transactions

17

Size

76.35 KB

Version

2

Bits

0aee292f

Nonce

62,261,501

Timestamp

1/8/2020, 5:39:39 PM

Confirmations

3,337,521

Merkle Root

27ebcb5344980faffca32a9c4f2f1db2ea96ba84235c7ac11b34946c5d3dd2c4
Transactions (17)
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.

4.555 × 10⁹⁴(95-digit number)
45553165323353531736…67406644522583069439
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
4.555 × 10⁹⁴(95-digit number)
45553165323353531736…67406644522583069439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.110 × 10⁹⁴(95-digit number)
91106330646707063473…34813289045166138879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.822 × 10⁹⁵(96-digit number)
18221266129341412694…69626578090332277759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.644 × 10⁹⁵(96-digit number)
36442532258682825389…39253156180664555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.288 × 10⁹⁵(96-digit number)
72885064517365650778…78506312361329111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.457 × 10⁹⁶(97-digit number)
14577012903473130155…57012624722658222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.915 × 10⁹⁶(97-digit number)
29154025806946260311…14025249445316444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.830 × 10⁹⁶(97-digit number)
58308051613892520623…28050498890632888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.166 × 10⁹⁷(98-digit number)
11661610322778504124…56100997781265776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.332 × 10⁹⁷(98-digit number)
23323220645557008249…12201995562531553279
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,989,107 XPM·at block #6,843,092 · 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