Block #3,505,470

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2020, 4:00:34 PM · Difficulty 10.9303 · 3,327,500 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d0ab1e31be43a4fa7fc131ee1496722e89021c8bde46aed617ea21ab8cb48997

Height

#3,505,470

Difficulty

10.930264

Transactions

17

Size

74.21 KB

Version

2

Bits

0aee25cb

Nonce

1,714,564,738

Timestamp

1/8/2020, 4:00:34 PM

Confirmations

3,327,500

Merkle Root

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

8.590 × 10⁹⁴(95-digit number)
85900905468326145373…21383726414102710559
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
8.590 × 10⁹⁴(95-digit number)
85900905468326145373…21383726414102710559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.718 × 10⁹⁵(96-digit number)
17180181093665229074…42767452828205421119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.436 × 10⁹⁵(96-digit number)
34360362187330458149…85534905656410842239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.872 × 10⁹⁵(96-digit number)
68720724374660916299…71069811312821684479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.374 × 10⁹⁶(97-digit number)
13744144874932183259…42139622625643368959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.748 × 10⁹⁶(97-digit number)
27488289749864366519…84279245251286737919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.497 × 10⁹⁶(97-digit number)
54976579499728733039…68558490502573475839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.099 × 10⁹⁷(98-digit number)
10995315899945746607…37116981005146951679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.199 × 10⁹⁷(98-digit number)
21990631799891493215…74233962010293903359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.398 × 10⁹⁷(98-digit number)
43981263599782986431…48467924020587806719
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,907,939 XPM·at block #6,832,969 · 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