Block #1,710,281

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2016, 6:12:22 AM · Difficulty 10.6364 · 5,123,200 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
148dcc3d668875508f472921c29f19c2e7205ea69fbff873163d3534d46060dd

Height

#1,710,281

Difficulty

10.636436

Transactions

2

Size

1017 B

Version

2

Bits

0aa2ed7c

Nonce

1,049,031,149

Timestamp

8/10/2016, 6:12:22 AM

Confirmations

5,123,200

Merkle Root

9786ec88aefe2c03eb9fdf8206a641bed2e4bd9c90db3aa66173264a36510185
Transactions (2)
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.

3.411 × 10⁹³(94-digit number)
34118144865504625165…01355139140873716159
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
3.411 × 10⁹³(94-digit number)
34118144865504625165…01355139140873716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.823 × 10⁹³(94-digit number)
68236289731009250330…02710278281747432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.364 × 10⁹⁴(95-digit number)
13647257946201850066…05420556563494864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.729 × 10⁹⁴(95-digit number)
27294515892403700132…10841113126989729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.458 × 10⁹⁴(95-digit number)
54589031784807400264…21682226253979458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.091 × 10⁹⁵(96-digit number)
10917806356961480052…43364452507958917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.183 × 10⁹⁵(96-digit number)
21835612713922960105…86728905015917834239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.367 × 10⁹⁵(96-digit number)
43671225427845920211…73457810031835668479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.734 × 10⁹⁵(96-digit number)
87342450855691840422…46915620063671336959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.746 × 10⁹⁶(97-digit number)
17468490171138368084…93831240127342673919
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,912,052 XPM·at block #6,833,480 · 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