Block #2,169,057

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/20/2017, 4:41:41 PM · Difficulty 10.8987 · 4,662,586 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d493b38af8fb946a97df19744d42699803522d112ca7d273d6890ba272090b15

Height

#2,169,057

Difficulty

10.898737

Transactions

3

Size

3.89 KB

Version

2

Bits

0ae613a6

Nonce

927,825,154

Timestamp

6/20/2017, 4:41:41 PM

Confirmations

4,662,586

Merkle Root

66b3058929956f8ceea9f21487f9bfa9e044193673ec583df66d7c21007367ba
Transactions (3)
1 in → 1 out8.4600 XPM110 B
3 in → 1 out10599.9900 XPM488 B
22 in → 1 out155.9600 XPM3.22 KB
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.446 × 10⁹⁴(95-digit number)
44463794051927430128…38001304578495911239
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.446 × 10⁹⁴(95-digit number)
44463794051927430128…38001304578495911239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.892 × 10⁹⁴(95-digit number)
88927588103854860257…76002609156991822479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.778 × 10⁹⁵(96-digit number)
17785517620770972051…52005218313983644959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.557 × 10⁹⁵(96-digit number)
35571035241541944103…04010436627967289919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.114 × 10⁹⁵(96-digit number)
71142070483083888206…08020873255934579839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.422 × 10⁹⁶(97-digit number)
14228414096616777641…16041746511869159679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.845 × 10⁹⁶(97-digit number)
28456828193233555282…32083493023738319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.691 × 10⁹⁶(97-digit number)
56913656386467110565…64166986047476638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.138 × 10⁹⁷(98-digit number)
11382731277293422113…28333972094953277439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.276 × 10⁹⁷(98-digit number)
22765462554586844226…56667944189906554879
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,897,249 XPM·at block #6,831,642 · 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