Block #3,505,096

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2020, 9:07:39 AM · Difficulty 10.9308 · 3,337,875 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4be4ae834031b528b2ff1cedc8d5fe53e92b923d9babf7d28ff036c07672f30f

Height

#3,505,096

Difficulty

10.930785

Transactions

17

Size

74.19 KB

Version

2

Bits

0aee47e7

Nonce

885,505,070

Timestamp

1/8/2020, 9:07:39 AM

Confirmations

3,337,875

Merkle Root

2d8b41f16b998d77866683d6085313f354c2c370014c566c91be80675c08a022
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.

1.040 × 10⁹⁶(97-digit number)
10401840214091943150…27751885447660339201
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
1.040 × 10⁹⁶(97-digit number)
10401840214091943150…27751885447660339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.080 × 10⁹⁶(97-digit number)
20803680428183886300…55503770895320678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.160 × 10⁹⁶(97-digit number)
41607360856367772600…11007541790641356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.321 × 10⁹⁶(97-digit number)
83214721712735545201…22015083581282713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.664 × 10⁹⁷(98-digit number)
16642944342547109040…44030167162565427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.328 × 10⁹⁷(98-digit number)
33285888685094218080…88060334325130854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.657 × 10⁹⁷(98-digit number)
66571777370188436161…76120668650261708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.331 × 10⁹⁸(99-digit number)
13314355474037687232…52241337300523417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.662 × 10⁹⁸(99-digit number)
26628710948075374464…04482674601046835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.325 × 10⁹⁸(99-digit number)
53257421896150748929…08965349202093670401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,988,121 XPM·at block #6,842,970 · 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