Block #1,740,321

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2016, 4:57:21 AM · Difficulty 10.7209 · 5,096,548 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a936e34867d4c10ec86e2520e165047b038dfa64469133e7c87c222a5d86d72

Height

#1,740,321

Difficulty

10.720860

Transactions

2

Size

41.17 KB

Version

2

Bits

0ab88a4b

Nonce

635,348,979

Timestamp

8/30/2016, 4:57:21 AM

Confirmations

5,096,548

Merkle Root

31f7450ef233a0fca23d59460272fb773ffe378dc6779485a2720bded7a87181
Transactions (2)
1 in → 1 out9.1900 XPM110 B
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.

7.344 × 10⁹⁵(96-digit number)
73449145265406274098…82078502999690053119
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
7.344 × 10⁹⁵(96-digit number)
73449145265406274098…82078502999690053119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.468 × 10⁹⁶(97-digit number)
14689829053081254819…64157005999380106239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.937 × 10⁹⁶(97-digit number)
29379658106162509639…28314011998760212479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.875 × 10⁹⁶(97-digit number)
58759316212325019278…56628023997520424959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.175 × 10⁹⁷(98-digit number)
11751863242465003855…13256047995040849919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.350 × 10⁹⁷(98-digit number)
23503726484930007711…26512095990081699839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.700 × 10⁹⁷(98-digit number)
47007452969860015422…53024191980163399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.401 × 10⁹⁷(98-digit number)
94014905939720030845…06048383960326799359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.880 × 10⁹⁸(99-digit number)
18802981187944006169…12096767920653598719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.760 × 10⁹⁸(99-digit number)
37605962375888012338…24193535841307197439
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,939,242 XPM·at block #6,836,868 · 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