Block #2,170,246

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/21/2017, 9:49:01 AM · Difficulty 10.9020 · 4,643,791 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d81b903f864182d4a7b620bbf544e5c9d4f527f0bb962c5c53be23d7b43aa3b

Height

#2,170,246

Difficulty

10.901991

Transactions

2

Size

539 B

Version

2

Bits

0ae6e8e1

Nonce

1,236,701,300

Timestamp

6/21/2017, 9:49:01 AM

Confirmations

4,643,791

Merkle Root

39ab73a510ee1b48189304132b54d1178a6905ae5396f9392a1a76184d150641
Transactions (2)
1 in → 1 out8.4100 XPM110 B
2 in → 1 out500.0000 XPM340 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.750 × 10⁹¹(92-digit number)
77508098723942641558…06622542481637007999
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.750 × 10⁹¹(92-digit number)
77508098723942641558…06622542481637007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.550 × 10⁹²(93-digit number)
15501619744788528311…13245084963274015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.100 × 10⁹²(93-digit number)
31003239489577056623…26490169926548031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.200 × 10⁹²(93-digit number)
62006478979154113246…52980339853096063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.240 × 10⁹³(94-digit number)
12401295795830822649…05960679706192127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.480 × 10⁹³(94-digit number)
24802591591661645298…11921359412384255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.960 × 10⁹³(94-digit number)
49605183183323290597…23842718824768511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.921 × 10⁹³(94-digit number)
99210366366646581194…47685437649537023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.984 × 10⁹⁴(95-digit number)
19842073273329316238…95370875299074047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.968 × 10⁹⁴(95-digit number)
39684146546658632477…90741750598148095999
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,756,371 XPM·at block #6,814,036 · 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